Maximizing the size of the giant

Journal of Applied Probability

Volumn 49, Issue 4, 2012, Pages 1156-1165

  Britton, Tom ^a   Trapman, Pieter ^a  

^a STOCKHOLM UNIVERSITY   (Sweden)

Author keywords

Branching process; Epidemiology; Random graph

Indexed keywords

EID: 84872337246     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1354716664     Document Type: Article

References (10)

1. Andersson, H. (1999). Epidemic models and social networks. Math. Sci. 24, 128-147.
2. Ball, F. G., Sirl, D. and Trapman, P. (2009). Threshold behaviour and final outcome of an epidemic on a random network with household structure. Adv. Appl. Prob. 41, 765-796.
3. Bollobás, B. (2001). Random Graphs, 2nd edn. Cambridge University Press.
4. Bollobás, B., Janson, S. and Riordan, O. (2007). The phase transition in inhomogeneous random graphs. Random Structures Algorithms 31, 3-122.
5. Britton, T., Deijfen, M., Lagerås, A. N. and Lindholm, M. (2008). Epidemics on random graphs with tunable clustering. J. Appl. Prob. 45, 743 - 756.
6. Durrett, R. (2006). Random Graph Dynamics. Cambridge University Press.
7. Jagers, P. (1975). Branching Processes with Biological Applications. JohnWiley, London.
8. Molloy, M. and Reed, B. (1998). The size of the giant component of a random graph with a given degree sequence. Combinatorics Prob. Comput. 7, 295-305.
9. Newman, M. E. J. (2002). Spread of epidemic disease on networks. Phys. Rev. E 66, 016128, 11pp.
10. Norros, I. and Reittu, H. (2006). On a conditionally Poissonian graph process. Adv. Appl. Prob. 38, 59-75.