On the expected total number of infections for virus spread on a finite network

DOI10.1214/14-AAP1007zbMath1322.60206arXiv1202.5429MaRDI QIDQ2341628

Antar Bandyopadhyay, Farkhondeh Sajadi

Publication date: 27 April 2015

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.5429

zbMATH Keywords

percolationlocal weak convergencefinite graphsvirus infectionsbreath-first searchrandom \(r\)-regular graphssusceptible infected removed model

Mathematics Subject Classification ID

Epidemiology (92D30) Random graphs (graph-theoretic aspects) (05C80) Applications of branching processes (60J85) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Cites Work

• Replica symmetry of the minimum matching
• A note about critical percolation on finite graphs
• Percolation on finite graphs and isoperimetric inequalities.
• Thresholds for virus spread on networks
• Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
• Percolation
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the expected total number of infections for virus spread on a finite network