Hostname: page-component-cb9f654ff-h4f6x Total loading time: 0 Render date: 2025-08-22T19:38:28.978Z Has data issue: false hasContentIssue false
  • English
  • Français

The extinction time of a subcritical branching process related to the SIR epidemic on a random graph

Part of: Markov processes Graph theory

Published online by Cambridge University Press:  30 March 2016

Peter Windridge
Peter Windridge*
Affiliation:
Queen Mary University of London
*
∗ Current address: HSBC, 8 Canada Square, London, E14 5HQ, UK. Email address: pete@windridge.org.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We give an exponential tail approximation for the extinction time of a subcritical multitype branching process arising from the SIR epidemic model on a random graph with given degrees, where the type corresponds to the vertex degree. As a corollary we obtain a Gumbel limit law for the extinction time, when beginning with a large population. Our contribution is to allow countably many types (this corresponds to unbounded degrees in the random graph epidemic model, as the number of vertices tends to∞). We only require a second moment for the offspring-type distribution featuring in our model.

Keywords

Multitype branching processexponential tail approximationGumbelSIR epidemic

MSC classification

Primary: 60J80: Branching processes (Galton-Watson, birth-and-death, etc.) 92D30: Epidemiology
Secondary: 05C80: Random graphs 60J28: Applications of continuous-time Markov processes on discrete state spaces

Information

Type
Short Communications
Information
Journal of Applied Probability , Volume 52 , Issue 4 , December 2015 , pp. 1195 - 1201
Copyright
Copyright © Applied Probability Trust 2015 

References

[1] Athreya, K. B. and Ney, P. E. (2004). Branching Processes. Dover, Mineola, NY.Google Scholar
[2] Bohman, T. and Picollelli, M. (2012). SIR epidemics on random graphs with a fixed degree sequence. Random Structures Algorithms 41, 179–214.Google Scholar
[3] Harris, T. E. (1963). The Theory of Branching Processes. Springer, Berlin.Google Scholar
[4] Hautphenne, S., Latouche, G. and Nguyen, G. (2013). Extinction probabilities of branching processes with countably infinitely many types. Adv. Appl. Prob. 45, 1068–1082.Google Scholar
[5] Heinzmann, D. (2009). Extinction times in multitype Markov branching processes. J. Appl. Prob. 46, 296–307.Google Scholar
[6] Jagers, P., Klebaner, F. C. and Sagitov, S. (2007). On the path to extinction. Proc. Nat. Acad. Sci. USA 104, 6107–6111.Google Scholar
[7] Janson, S., Luczak, M. and Windridge, P. (2014). Law of large numbers for the SIR epidemic on a random graph with given degrees. Random Structures Algorithms 45, 724–761.Google Scholar
[8] Pakes, A. G. (1989). Asymptotic results for the extinction time of Markov branching processes allowing emigration. I. Random walk decrements. Adv. Appl. Prob. 21, 243–269.Google Scholar
[9] Sagitov, S. (2013). Linear-fractional branching processes with countably many types. Stoch. Process. Appl. 123, 2940–2956.Google Scholar