| Literature DB >> 26085930 |
Stephen Eubank1, Mina Youssef2, Yasamin Khorramzadeh3.
Abstract
We consider methods for solving certain network characterization and design problems that arise in network epidemiology. We argue that the network reliability polynomial introduced by Moore and Shannon is a useful framework in which to reason about these problems. Specifically, we show how efficient estimation of the polynomial permits characterizing and distinguishing very large networks in ways that are are dynamically relevant. Furthermore, a generalization of flows and cuts to structures that determine the reliability suggests a new measure of edge or vertex centrality that we call criticality. We describe how criticality is related to the more common notion of betweenness and illustrate its application to targeting interventions to control outbreaks of infectious disease. Although our applications are to infectious disease outbreaks, the methods we develop are applicable to many other diffusive dynamical systems over complex networks.Entities:
Keywords: complex networks; graph theory; graphical models; network reliability; network theory; network topology
Year: 2014 PMID: 26085930 PMCID: PMC4465801 DOI: 10.1093/comnet/cnu037
Source DB: PubMed Journal: J Complex Netw ISSN: 2051-1310