Determining whether a class of random graphs is consistent with an observed contact network

DOI10.1016/J.JTBI.2017.12.021zbMath1400.92527OpenAlexW2951023854WikidataQ47230188 ScholiaQ47230188MaRDI QIDQ1648951

Madhurima Nath, Yihui Ren, Yasamin Khorramzadeh, Stephen Eubank

Publication date: 5 July 2018

Published in: Journal of Theoretical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jtbi.2017.12.021

zbMATH Keywords

network reliabilityepidemic modelingnetwork structureERGMepidemic potential

Mathematics Subject Classification ID

Epidemiology (92D30) Random graphs (graph-theoretic aspects) (05C80) Systems biology, networks (92C42)

Related Items (1)

MARKOV CHAIN METHOD FOR COMPUTING THE RELIABILITY OF HAMMOCK NETWORKS

Uses Software

• ergm
• statnet

Cites Work

• Unnamed Item
• Effective degree network disease models
• Network theory and SARS: predicting outbreak diversity
• Dynamical patterns of epidemic outbreaks in complex heterogeneous networks
• The Mathematics of Infectious Diseases
• Emergence of Scaling in Random Networks
• Collective dynamics of ‘small-world’ networks
• Reliable circuits using less reliable relays

This page was built for publication: Determining whether a class of random graphs is consistent with an observed contact network