{"id":{"repo_id":"rowan","oai_identifier":"oai:rdw.rowan.edu:etd-4259"},"canonical_url":"https://search.ndltd.org/etd/rowan/oai:rdw.rowan.edu:etd-4259","repository":{"repo_id":"rowan","name":"Rowan University","base_url":"https://rdw.rowan.edu/do/oai/"},"display":{"title":"AN EMPIRICAL STUDY ON DETECTING AND EXPLAINING GLOBAL STRUCTURAL CHANGE IN EVOLVING GRAPH USING MARTINGALE","abstract":"There is a growing interest in practical applications involving networks of interacting entities such as sensor networks, social networks, urban traffic networks, and power grids, all of which can be represented using evolving graphs. Changes in these evolving graphs can signify shifts in the behavior of interacting entities or alterations in the patterns of their interactions. Identifying and detecting these changes is crucial for addressing potential challenges or opportunities in various domains. In this study, we propose an approach for detecting structure change in evolving graphs based on the martingale change detection framework on multiple graph features extracted over time. Our research investigates the impact of different graph properties encoded using different feature representations on the evolving graph change detection task. Moreover, performing change detection on multiple graph features allows us to pinpoint which aspects of the graph behavior have changed and provide explanations for identified changes. We demonstrated empirically the robustness of our proposed approach on synthetic evolving graphs generated using different graph-generating algorithms, including scale-free, phase transition, and random small-world evolving graphs. Furthermore, we demonstrate that the proposed martingale approach maintains a desirable false positive bound even when different feature representations are used. Finally, we demonstrate monitoring martingale values for different graph properties on a real-world evolving graph sequence to explain the detected change points.","abstract_html":"There is a growing interest in practical applications involving networks of interacting entities such as sensor networks, social networks, urban traffic networks, and power grids, all of which can be represented using evolving graphs. Changes in these evolving graphs can signify shifts in the behavior of interacting entities or alterations in the patterns of their interactions. Identifying and detecting these changes is crucial for addressing potential challenges or opportunities in various domains. In this study, we propose an approach for detecting structure change in evolving graphs based on the martingale change detection framework on multiple graph features extracted over time. Our research investigates the impact of different graph properties encoded using different feature representations on the evolving graph change detection task. Moreover, performing change detection on multiple graph features allows us to pinpoint which aspects of the graph behavior have changed and provide explanations for identified changes. We demonstrated empirically the robustness of our proposed approach on synthetic evolving graphs generated using different graph-generating algorithms, including scale-free, phase transition, and random small-world evolving graphs. Furthermore, we demonstrate that the proposed martingale approach maintains a desirable false positive bound even when different feature representations are used. Finally, we demonstrate monitoring martingale values for different graph properties on a real-world evolving graph sequence to explain the detected change points.","abstract_has_math":false,"creators":["Kairamkonda, Tarun Teja"],"institution":null,"degree_name":"Master of Science (M.S.) in Computer Science","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Shen-Shyang Ho, Ph.D.","Anthony Breitzman, Ph.D.","Guimu Guo, Ph.D."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:59:46Z","subjects":["Change-point Detection; Machine Learning; Non-parametric Statistics; Probabilistic Algorithm","Graph theory","Networks","Applied Mathematics","Computer Sciences"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://rdw.rowan.edu/etd/3253","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://rdw.rowan.edu/etd/3253","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://rdw.rowan.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Ardw.rowan.edu%3Aetd-4259","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Shen-Shyang Ho, Ph.D.","Anthony Breitzman, Ph.D.","Guimu Guo, Ph.D."]},{"key":"dc:creator","label":"Author","values":["Kairamkonda, Tarun Teja"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2024-06-24T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2024-06-20T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (M.S.) in Computer Science"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Change-point Detection; Machine Learning; Non-parametric Statistics; Probabilistic Algorithm","Graph theory","Networks","Applied Mathematics","Computer Sciences"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://rdw.rowan.edu/etd/3253"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["There is a growing interest in practical applications involving networks of interacting entities such as sensor networks, social networks, urban traffic networks, and power grids, all of which can be represented using evolving graphs. Changes in these evolving graphs can signify shifts in the behavior of interacting entities or alterations in the patterns of their interactions. Identifying and detecting these changes is crucial for addressing potential challenges or opportunities in various domains. In this study, we propose an approach for detecting structure change in evolving graphs based on the martingale change detection framework on multiple graph features extracted over time. Our research investigates the impact of different graph properties encoded using different feature representations on the evolving graph change detection task. Moreover, performing change detection on multiple graph features allows us to pinpoint which aspects of the graph behavior have changed and provide explanations for identified changes. We demonstrated empirically the robustness of our proposed approach on synthetic evolving graphs generated using different graph-generating algorithms, including scale-free, phase transition, and random small-world evolving graphs. Furthermore, we demonstrate that the proposed martingale approach maintains a desirable false positive bound even when different feature representations are used. Finally, we demonstrate monitoring martingale values for different graph properties on a real-world evolving graph sequence to explain the detected change points."]},{"key":"dc:title","label":"Title","values":["AN EMPIRICAL STUDY ON DETECTING AND EXPLAINING GLOBAL STRUCTURAL CHANGE IN EVOLVING GRAPH USING MARTINGALE"]}]}],"canonical_facts":{"dc:contributor":["Shen-Shyang Ho, Ph.D.","Anthony Breitzman, Ph.D.","Guimu Guo, Ph.D."],"dc:creator":["Kairamkonda, Tarun Teja"],"dc:date.available":["2024-06-24T07:00:00Z"],"dc:date.created":["2024-06-20T07:00:00Z"],"dc:description.abstract":["There is a growing interest in practical applications involving networks of interacting entities such as sensor networks, social networks, urban traffic networks, and power grids, all of which can be represented using evolving graphs. Changes in these evolving graphs can signify shifts in the behavior of interacting entities or alterations in the patterns of their interactions. Identifying and detecting these changes is crucial for addressing potential challenges or opportunities in various domains. In this study, we propose an approach for detecting structure change in evolving graphs based on the martingale change detection framework on multiple graph features extracted over time. Our research investigates the impact of different graph properties encoded using different feature representations on the evolving graph change detection task. Moreover, performing change detection on multiple graph features allows us to pinpoint which aspects of the graph behavior have changed and provide explanations for identified changes. We demonstrated empirically the robustness of our proposed approach on synthetic evolving graphs generated using different graph-generating algorithms, including scale-free, phase transition, and random small-world evolving graphs. Furthermore, we demonstrate that the proposed martingale approach maintains a desirable false positive bound even when different feature representations are used. Finally, we demonstrate monitoring martingale values for different graph properties on a real-world evolving graph sequence to explain the detected change points."],"dc:identifier":["https://rdw.rowan.edu/etd/3253"],"dc:subject":["Change-point Detection; Machine Learning; Non-parametric Statistics; Probabilistic Algorithm","Graph theory","Networks","Applied Mathematics","Computer Sciences"],"dc:title":["AN EMPIRICAL STUDY ON DETECTING AND EXPLAINING GLOBAL STRUCTURAL CHANGE IN EVOLVING GRAPH USING MARTINGALE"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (M.S.) in Computer Science"]},"updated_at":"2026-11-19T08:59:46Z"}