This thesis studies the robustness of complex dynamical networks with non-trivial topologies against global perturbations, following Robert May’s seminal work on network stability, in order to find critical stability thresholds of global perturbations and to determine if their impact varies across different network topologies. Numerical analysis is used as the primary research method. Dynamical networks are randomly generated in the form of a coefficient matrix of stable linear differential equations. The networks are then inflicted with global perturbation (i.e., addition of another random matrix with varying magnitudes) and their stabilities are tested for each perturbation magnitude, to determine at what scale of global perturbation they are jarred to instability.
The results show a monotonic decrease of the instability threshold over increasing link density for all network topologies. For a given link density, random regular networks show highest robustness against global perturbation, closely followed by Watts-Strogatz small-world networks and Erdos-Renyi random graphs, and then Barabasi-Albert scalefree networks are least robust among the four topologies tested. Fully connected networks used in May’s original work are found to be consistently unstable in the presence of global perturbation of any magnitude. These findings offer useful implications for the robustness and sustainability/vulnerability of real-world complex networks with nontrivial topologies.
","abstract_html":"<p>This thesis studies the robustness of complex dynamical networks with non-trivial topologies against global perturbations, following Robert May’s seminal work on network stability, in order to find critical stability thresholds of global perturbations and to determine if their impact varies across different network topologies. Numerical analysis is used as the primary research method. Dynamical networks are randomly generated in the form of a coefficient matrix of stable linear differential equations. The networks are then inflicted with global perturbation (i.e., addition of another random matrix with varying magnitudes) and their stabilities are tested for each perturbation magnitude, to determine at what scale of global perturbation they are jarred to instability.</p> <p>The results show a monotonic decrease of the instability threshold over increasing link density for all network topologies. For a given link density, random regular networks show highest robustness against global perturbation, closely followed by Watts-Strogatz small-world networks and Erdos-Renyi random graphs, and then Barabasi-Albert scalefree networks are least robust among the four topologies tested. Fully connected networks used in May’s original work are found to be consistently unstable in the presence of global perturbation of any magnitude. These findings offer useful implications for the robustness and sustainability/vulnerability of real-world complex networks with nontrivial topologies.</p>","abstract_has_math":false,"creators":["Heiserman, Samuel"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Systems Science and Industrial Engineering","degree_department":null,"school":null,"contributors":["Dr. Hiroki Sayama, Committee Chair","Dr. Harold Lewis","Dr. Mohammad Khasawneh"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-04-01T07:00:00Z","date_published":"2014-04-01T07:00:00Z","updated_at":"2026-07-24T01:10:09Z","subjects":["Systems Science","Systems Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://orb.binghamton.edu/dissertation_and_theses/19","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Dr. Hiroki Sayama, Committee Chair","Dr. Harold Lewis","Dr. Mohammad Khasawneh"]},{"key":"dc:creator","label":"Author","values":["Heiserman, Samuel"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2017-07-14T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Systems Science and Industrial Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Systems Science","Systems Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://orb.binghamton.edu/dissertation_and_theses/19"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis studies the robustness of complex dynamical networks with non-trivial topologies against global perturbations, following Robert May’s seminal work on network stability, in order to find critical stability thresholds of global perturbations and to determine if their impact varies across different network topologies. Numerical analysis is used as the primary research method. Dynamical networks are randomly generated in the form of a coefficient matrix of stable linear differential equations. The networks are then inflicted with global perturbation (i.e., addition of another random matrix with varying magnitudes) and their stabilities are tested for each perturbation magnitude, to determine at what scale of global perturbation they are jarred to instability.
The results show a monotonic decrease of the instability threshold over increasing link density for all network topologies. For a given link density, random regular networks show highest robustness against global perturbation, closely followed by Watts-Strogatz small-world networks and Erdos-Renyi random graphs, and then Barabasi-Albert scalefree networks are least robust among the four topologies tested. Fully connected networks used in May’s original work are found to be consistently unstable in the presence of global perturbation of any magnitude. These findings offer useful implications for the robustness and sustainability/vulnerability of real-world complex networks with nontrivial topologies.
"]},{"key":"dc:title","label":"Title","values":["Robustness of complex networks to global perturbations"]}]}],"canonical_facts":{"dc:contributor":["Dr. Hiroki Sayama, Committee Chair","Dr. Harold Lewis","Dr. Mohammad Khasawneh"],"dc:creator":["Heiserman, Samuel"],"dc:date.available":["2017-07-14T07:00:00Z"],"dc:description.abstract":["This thesis studies the robustness of complex dynamical networks with non-trivial topologies against global perturbations, following Robert May’s seminal work on network stability, in order to find critical stability thresholds of global perturbations and to determine if their impact varies across different network topologies. Numerical analysis is used as the primary research method. Dynamical networks are randomly generated in the form of a coefficient matrix of stable linear differential equations. The networks are then inflicted with global perturbation (i.e., addition of another random matrix with varying magnitudes) and their stabilities are tested for each perturbation magnitude, to determine at what scale of global perturbation they are jarred to instability.
The results show a monotonic decrease of the instability threshold over increasing link density for all network topologies. For a given link density, random regular networks show highest robustness against global perturbation, closely followed by Watts-Strogatz small-world networks and Erdos-Renyi random graphs, and then Barabasi-Albert scalefree networks are least robust among the four topologies tested. Fully connected networks used in May’s original work are found to be consistently unstable in the presence of global perturbation of any magnitude. These findings offer useful implications for the robustness and sustainability/vulnerability of real-world complex networks with nontrivial topologies.
"],"dc:identifier":["https://orb.binghamton.edu/dissertation_and_theses/19"],"dc:subject":["Systems Science","Systems Engineering"],"dc:title":["Robustness of complex networks to global perturbations"],"thesis:degree_discipline":["Systems Science and Industrial Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-07-24T01:10:09Z"}