Cargando…

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

We demonstrate a general method to analyze the sensitivity of attack rate in a network model of infectious disease epidemiology to the structure of the network. We use Moore and Shannon’s “network reliability” statistic to measure the epidemic potential of a network. A number of networks are generat...

Descripción completa

Detalles Bibliográficos
Autores principales: Nath, Madhurima, Ren, Yihui, Khorramzadeh, Yasamin, Eubank, Stephen
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2017
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6026086/
https://www.ncbi.nlm.nih.gov/pubmed/29289606
http://dx.doi.org/10.1016/j.jtbi.2017.12.021
_version_ 1783336381270982656
author Nath, Madhurima
Ren, Yihui
Khorramzadeh, Yasamin
Eubank, Stephen
author_facet Nath, Madhurima
Ren, Yihui
Khorramzadeh, Yasamin
Eubank, Stephen
author_sort Nath, Madhurima
collection PubMed
description We demonstrate a general method to analyze the sensitivity of attack rate in a network model of infectious disease epidemiology to the structure of the network. We use Moore and Shannon’s “network reliability” statistic to measure the epidemic potential of a network. A number of networks are generated using exponential random graph models based on the properties of the contact network structure of one of the Add Health surveys. The expected number of infections on the original Add Health network is significantly different from that on any of the models derived from it. Because individual-level transmissibility and network structure are not separately identifiable parameters given population-level attack rate data it is possible to re-calibrate the transmissibility to fix this difference. However, the temporal behavior of the outbreak remains significantly different. Hence any estimates of the effectiveness of time dependent interventions on one network are unlikely to generalize to the other. Moreover, we show that in one case even a small perturbation to the network spoils the re-calibration. Unfortunately, the set of sufficient statistics for specifying a contact network model is not yet known. Until it is, estimates of the outcome of a dynamical process on a particular network obtained from simulations on a different network are not reliable.
format Online
Article
Text
id pubmed-6026086
institution National Center for Biotechnology Information
language English
publishDate 2017
record_format MEDLINE/PubMed
spelling pubmed-60260862018-09-23 Determining whether a class of random graphs is consistent with an observed contact network Nath, Madhurima Ren, Yihui Khorramzadeh, Yasamin Eubank, Stephen J Theor Biol Article We demonstrate a general method to analyze the sensitivity of attack rate in a network model of infectious disease epidemiology to the structure of the network. We use Moore and Shannon’s “network reliability” statistic to measure the epidemic potential of a network. A number of networks are generated using exponential random graph models based on the properties of the contact network structure of one of the Add Health surveys. The expected number of infections on the original Add Health network is significantly different from that on any of the models derived from it. Because individual-level transmissibility and network structure are not separately identifiable parameters given population-level attack rate data it is possible to re-calibrate the transmissibility to fix this difference. However, the temporal behavior of the outbreak remains significantly different. Hence any estimates of the effectiveness of time dependent interventions on one network are unlikely to generalize to the other. Moreover, we show that in one case even a small perturbation to the network spoils the re-calibration. Unfortunately, the set of sufficient statistics for specifying a contact network model is not yet known. Until it is, estimates of the outcome of a dynamical process on a particular network obtained from simulations on a different network are not reliable. 2017-12-29 2018-03-07 /pmc/articles/PMC6026086/ /pubmed/29289606 http://dx.doi.org/10.1016/j.jtbi.2017.12.021 Text en This is an open access article under the CC BY-NC-ND license. (http://creativecommons.org/licenses/by-nc-nd/4.0/)
spellingShingle Article
Nath, Madhurima
Ren, Yihui
Khorramzadeh, Yasamin
Eubank, Stephen
Determining whether a class of random graphs is consistent with an observed contact network
title Determining whether a class of random graphs is consistent with an observed contact network
title_full Determining whether a class of random graphs is consistent with an observed contact network
title_fullStr Determining whether a class of random graphs is consistent with an observed contact network
title_full_unstemmed Determining whether a class of random graphs is consistent with an observed contact network
title_short Determining whether a class of random graphs is consistent with an observed contact network
title_sort determining whether a class of random graphs is consistent with an observed contact network
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6026086/
https://www.ncbi.nlm.nih.gov/pubmed/29289606
http://dx.doi.org/10.1016/j.jtbi.2017.12.021
work_keys_str_mv AT nathmadhurima determiningwhetheraclassofrandomgraphsisconsistentwithanobservedcontactnetwork
AT renyihui determiningwhetheraclassofrandomgraphsisconsistentwithanobservedcontactnetwork
AT khorramzadehyasamin determiningwhetheraclassofrandomgraphsisconsistentwithanobservedcontactnetwork
AT eubankstephen determiningwhetheraclassofrandomgraphsisconsistentwithanobservedcontactnetwork