Graphs with specified degree distributions, simple epidemics, and local vaccination strategies

Advances in Applied Probability

Volumn 39, Issue 4, 2007, Pages 922-948

  Britton, Tom ^a   Janson, Svante ^b   Martin Löf, Anders ^a  

^a STOCKHOLM UNIVERSITY   (Sweden)

^b UPPSALA UNIVERSITY   (Sweden)

Author keywords

Degree distribution; Epidemic model; Final size; Limit theorem; Networks; Random graph; Vaccination

Indexed keywords

ASYMPTOTIC ANALYSIS; GRAPH THEORY; MATHEMATICAL MODELS; PROBABILITY;

DEGREE DISTRIBUTION; EPIDEMIC MODEL; FINAL SIZE; LIMIT THEOREM; RANDOM GRAPH;

RANDOM PROCESSES;

EID: 39649095169     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1198177233     Document Type: Article

References (20)

1. ANDERSSON, H. (1999). Epidemic models and social networks. Math. Scientist 24, 128-147.
2. ANDERSSON, H. AND BRITTON, T. (2000). Stochastic Epidemic Models and Their Statistical Analysis (Lecture Notes Statist. 151). Springer, New York.
3. ATHREYA, K. B. AND NEY, P. E. (1972). Branching Processes. Springer, Berlin.
4. BOLLOBÁS, B. (2001). Random Graphs, 2nd edn. Cambridge University Press.
5. BOLLOBÁS, B., JANSON, S. AND RIORDAN, O. (2007). The phase transition in inhomogeneous random graphs. Random Structures Algorithms 31, 3-122.
6. BRITTON, T., DEIJFEN, M. AND MARTIN-LÖF, A. (2006). Generating simple random graphs with prescribed degree distribution. J. Statist. Phys. 124, 1377-1397.
7. COHEN, R. HAVLIN, S. AND BEN-AVRAHAN, D. (2003). Efficient immunization strategies for computer networks and populations. Phys. Rev. Lett. 91, 247901.
8. GUT, A. (2005). Probability: A Graduate Course. Springer, New York.
9. JANSON, S. (2006). The probability that a random multigraph is simple. Available at http://arxiv.org/abs/math/0609802.
10. JANSON, S. (2007). Asymptotic equivalence and contiguity of some random graphs. In preparation.
11. JANSON, S., LUCZAK, T. AND RUCIŃSKI, A. (2000). Random Graphs. John Wiley, New York.
12. JANSON, S., KNUTH, D., ŁUCZAK, T. AND PITTFL, B. (1994). The birth of the giant component. Random Structures Algorithms 4, 231-358.
13. KALLENBERG, O. (2002). Foundations of Modern Probability, 2nd edn. Springer, New York.
14. McKAY, B. D. (1985). Asymptotics for symmetric 0-1 matrices with prescribed row sums. Ars Combin. 19, 15-25.
15. MOLLOY, M. AND REED, B. (1995). A critical point for random graphs with a given degree sequence. Random Structures Algorithms 6, 161-179.
16. MOLLOY, M. AND REED, B. (1998). The size of the giant component of a random graph with a given degree sequence. Combin. Prob. Comput. 7, 295-305.
17. MOORE, C. AND NEWMAN, M. E. J. (2000). Epidemics and percolation in small world networks. Phys. Rev. E 61, 5678-5682.
18. NEWMAN, M. E. J. (2003). The structure and function of complex networks. SIAM Rev. 45, 167-256.
19. NEWMAN, M. E. J., STROGATZ, S. H. AND WATTS, J. (2001). Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118.
20. SCOTT, J. (2000). Social Network Analysis, A Handbook, 2nd edn. Sage, London.