schliessen

Filtern

 

Bibliotheken

Using the network reliability polynomial to characterize and design networks

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... Full description

Journal Title: Journal of Complex Networks 2014, Vol. 2(4), pp.356-372
Main Author: Eubank, Stephen
Other Authors: Youssef, Mina , Khorramzadeh, Yasamin
Format: Electronic Article Electronic Article
Language:
Subjects:
ID: ISSN: 2051-1310 ; E-ISSN: 2051-1329 ; DOI: 10.1093/comnet/cnu037
Zum Text:
SendSend as email Add to Book BagAdd to Book Bag
Staff View
recordid: oxford10.1093/comnet/cnu037
title: Using the network reliability polynomial to characterize and design networks
format: Article
creator:
  • Eubank, Stephen
  • Youssef, Mina
  • Khorramzadeh, Yasamin
subjects:
  • Complex Networks
  • Network Topology
  • Network Reliability
  • Network Theory
  • Graph Theory
  • Graphical Models
ispartof: Journal of Complex Networks, 2014, Vol. 2(4), pp.356-372
description: 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 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.
language:
source:
identifier: ISSN: 2051-1310 ; E-ISSN: 2051-1329 ; DOI: 10.1093/comnet/cnu037
fulltext: fulltext
issn:
  • 2051-1310
  • 20511310
  • 2051-1329
  • 20511329
url: Link


@attributes
ID1792282899
RANK0.07
NO1
SEARCH_ENGINEprimo_central_multiple_fe
SEARCH_ENGINE_TYPEPrimo Central Search Engine
LOCALfalse
PrimoNMBib
record
control
sourcerecordid10.1093/comnet/cnu037
sourceidoxford
recordidTN_oxford10.1093/comnet/cnu037
sourceformatXML
sourcesystemPC
pqid1826615965
display
typearticle
titleUsing the network reliability polynomial to characterize and design networks
creatorEubank, Stephen ; Youssef, Mina ; Khorramzadeh, Yasamin
ispartofJournal of Complex Networks, 2014, Vol. 2(4), pp.356-372
identifier
subjectComplex Networks ; Network Topology ; Network Reliability ; Network Theory ; Graph Theory ; Graphical Models
descriptionWe 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 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.
source
version4
links
openurl$$Topenurl_article
openurlfulltext$$Topenurlfull_article
search
creatorcontrib
0Eubank, Stephen
1Youssef, Mina
2Khorramzadeh, Yasamin
titleUsing the network reliability polynomial to characterize and design networks
descriptionWe 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 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.
subject
0complex networks
1network topology
2network reliability
3network theory
4graph theory
5graphical models
general
0cnu037
110.1093/comnet/cnu037
2Oxford Journals
sourceidoxford
recordidoxford10.1093/comnet/cnu037
issn
02051-1310
120511310
22051-1329
320511329
rsrctypearticle
creationdate2014
addtitleJournal of Complex Networks
searchscopeoxford
scopeoxford
lsr40201412
lsr4120141021
lsr30VSR-Enriched:[pqid]
sort
titleUsing the network reliability polynomial to characterize and design networks
authorEubank, Stephen ; Youssef, Mina ; Khorramzadeh, Yasamin
creationdate20141200
facets
frbrgroupid24827967847474890
frbrtype5
newrecords20170612
creationdate2014
topic
0Complex Networks
1Network Topology
2Network Reliability
3Network Theory
4Graph Theory
5Graphical Models
collectionOxford Journals (Oxford University Press)
prefilterarticles
rsrctypearticles
creatorcontrib
0Eubank, Stephen
1Youssef, Mina
2Khorramzadeh, Yasamin
jtitleJournal Of Complex Networks
delivery
delcategoryRemote Search Resource
fulltextfulltext
addata
aulast
0Eubank
1Youssef
2Khorramzadeh
aufirst
0Stephen
1Mina
2Yasamin
au
0Eubank, Stephen
1Youssef, Mina
2Khorramzadeh, Yasamin
atitleUsing the network reliability polynomial to characterize and design networks
jtitleJournal of Complex Networks
risdate201412
volume2
issue4
spage356
epage372
pages356-372
issn2051-1310
eissn2051-1329
formatjournal
genrearticle
ristypeJOUR
abstractWe 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 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.
pubOxford University Press
doi10.1093/comnet/cnu037
date2014-12