Law of large numbers for the SIR epidemic on a random graph with given degrees

Random Structures and Algorithms

Volumn 45, Issue 4, 2014, Pages 726-763

  Janson, Svante ^a   Luczak, Malwina ^b   Windridge, Peter ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Configuration model; Random graph with given degree sequence; SIR epidemic process

Indexed keywords

EID: 84918593893     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20575     Document Type: Article

References (40)

1. H. Andersson, Limit theorems for a random graph epidemic model, Ann Appl Probab 8 (1998), 1331-1349
2. H. Andersson, Epidemic models and social networks, Math Sci 24 (1999), 128-147.
3. R. Arratia, A. D. Barbour, and S. Tavaré, Logarithmic combinatorial structures: A probabilistic approach, EMS, Zürich, 2003.
4. F. Ball and P. Neal, Network epidemic models with two levels of mixing, Math Biosci 212 (2008), 69-87.
5. F. Ball, D. Sirl, and P. Trapman, Analysis of a stochastic SIR, epidemic on a random network incorporating household structure, Math Biosci 224 (2010), 53-73.
6. A. D. Barbour and G. Reinert, Approximating the epidemic curve, Electron J Probab 18, no. 54, (2013).
7. T. Bohman and A. Frieze, Karp-Sipser on random graphs with a fixed degree sequence, Combin Probab Comput 20 (2011), 721-741
8. T. Bohman and M. Picollelli, SIR, epidemics on random graphs with a fixed degree sequence, Random Structr Algorithms 41 (2012), 179-214.
9. B. Bollobás, Random graphs, second edition, Cambridge University Press, Cambridge, 2001.
10. B. Bollobás, and O. Riordan, An old approach to the giant component problem, arXiv: 1209.3691, September 2012.
11. T. Britton, M. Deijfen, A. N. Lagerås, and M. Lindholm, Epidemics on random graphs with tunable clustering, J Appl Probab 45 (2008), 743-756.
12. T. Britton, S. Janson, and A. Martin-Löf, Graphs with specified degree distributions, simple epidemics, and local vaccination strategies, Adv Appl Probab 39 (2007), 922-948.
13. S. Chatterjee and R. Durrett, Contact processes on random graphs with power law degree distributions have critical value 0, Ann Probab 37 (2009), 2332-2356.
14. D. J. Daley, and J. Gani, Epidemic modelling: An introduction, Cambridge University Press, Cambridge, 1999.
15. R. W. R. Darling, and J. R. Norris, Differential equation approximations for Markov chains, Probab Surv 5 (2008), 37-79.
16. L. Decreusefond, J.-S. Dhersin, P. Moyal, and V. C. Tran, Large graph limit for an SIR, process in random network with heterogeneous connectivity, Ann Appl Probab 22 (2012), 541-575.
17. S. N. Ethier and T. G. Kurtz, Markov processes: Characterization and convergence, Wiley, New York, 1986.
18. D. Fernholz and V. Ramachandran, The diameter of sparse random graphs, Random Struct Algorithms 31 (2007), 482-516.
19. A. Frieze, M. Krivelevich, and C. Smyth, On the chromatic number of random graphs with a fixed degree sequence, Comb Probab Comput 16 (2007), 733-746.
20. T. House, Modelling epidemics on networks, Contemp Phys 53 (2012), 213-225.
21. S. Janson, The probability that a random multigraph is simple, Comb Probab Comput 18 (2009), 205-225.
22. S. Janson, The probability that a random multigraph is simple, II, J Applied Probability 51A, to appear.
23. S. Janson and M. J. Luczak, A simple solution to the k-core problem, Random Struct Algorithms 30 (2007), 50-62.
24. S. Janson and M. J. Luczak, Asymptotic normality of the k-core in random graphs, Ann Appl Probab 18 (2008), 1085-1137.
25. S. Janson and M. J. Luczak, A new approach to the giant component problem, Random Struct Algorithms 34 (2009), 197-216.
26. A. Joseph, The component sizes of a critical random graph with given degree sequence, arXiv:1012.2352, December 2010.
27. O. Kallenberg, Foundations of modern probability, second edition, Springer-Verlag, New York, 2002.
28. M. Kang and T. G. Seierstad, The critical phase for random graphs with a given degree sequence, Comb Probab Comput 17 (2008), 67-86.
29. J. C. Miller, A note on a paper by Erik Volz: SIR dynamics in random networks, J Math Biol 62 (2011), 349-358.
30. M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Struct Algorithms 6 (1995), 161-179.
31. M. Molloy and B. Reed, The size of the giant component of a random graph with a given degree sequence, Combin Probab Comput 7 (1998), 295-305.
32. P. Neal, SIR, epidemics on a Bernoulli random graph, J Appl Probab 40 (2003), 779-782.
33. M. E. J. Newman, Spread of epidemic disease on networks, Phys Rev E 66 (2002), 016128.
34. M. E. J. Newman, S. H. Strogatz, and D. J. Watts, Random graphs with arbitrary degree distributions and their applications, Phys Rev E 64, (2001), 026118.
35. F. W. J. Olver, D. W. Lozier, R. F. Boisvert, and C. W. Clark, NIST handbook of mathematical functions, Cambridge University Press, Cambridge, 2010. Available as NIST Digital Library of Mathematical Functions, at http://dlmf.nist.gov/ (last accessed 6/10/2014).
36. P. E. Protter, Stochastic integration and differential equations, Volume 21 of Stochastic Modelling and Applied Probability, second edition, Springer-Verlag, Berlin, 2005, Version 2.1, Corrected third printing.
37. D. Revuz and M. Yor, Continuous martingales and Brownian motion, Volume 293 of Grundlehren der Mathematischen Wissenschaften [fundamental principles of mathematical sciences], third edition, Springer-Verlag, Berlin, 1999.
38. L. C. G. Rogers, and D. Williams, Diffusions, Markov processes, and martingales. Vol. 1. Foundations (2000). Reprint of the second (1994) edition.
39. C. M. Sato, On the robustness of random k-cores, Eur J Comb 41 (2014), 163-182.
40. E. Volz, SIR, dynamics in random networks with heterogeneous connectivity, J Math Biol 56 (2008), 293-310.