Hostname: page-component-7b7567c8c-8p88z Total loading time: 0 Render date: 2026-11-19T09:56:02.148Z Has data issue: false hasContentIssue false

The front of the epidemic spread and first passage percolation

Published online by Cambridge University Press:  30 March 2016

Shankar Bhamidi
Affiliation:
Department of Statistics, University of North Carolina, Chapel Hill, USA. Email address: bhamidi@email.unc.edu.
Remco van der Hofstad
Affiliation:
Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands. Email address: rhofstad@win.tue.nl.
Júlia Komjáthy
Affiliation:
Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands. Email address: j.komjathy@tue.nl.
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 establish a connection between epidemic models on random networks with general infection times considered in Barbour and Reinert (2013) and first passage percolation. Using techniques developed in Bhamidi, van der Hofstad and Hooghiemstra (2012), when each vertex has infinite contagious periods, we extend results on the epidemic curve in Barbour and Reinert (2013) from bounded degree graphs to general sparse random graphs with degrees having finite second moments as n → ∞, with an appropriate X 2log+ X condition. We also study the epidemic trail between the source and typical vertices in the graph.

Information

Type
Part 4. Random graphs and particle systems
Copyright
Copyright © Applied Probability Trust 2014