Universality for first passage percolation on sparse random graphs

DOI10.1214/16-AOP1120zbMath1376.60018arXiv1210.6839OpenAlexW2112911366MaRDI QIDQ2406570

Gerard Hooghiemstra, Remco van der Hofstad, Shankar Bhamidi

Publication date: 5 October 2017

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.6839

zbMATH Keywords

random graphscentral limit theoremextreme value theoryPoisson point processpoint process convergencefirst passage percolationhopcountcontinuous-time branching processesMalthusian rate of growthstable-age distribution

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

Related Items (18)

First passage percolation on the Newman-Watts small world model ⋮ Local neighbourhoods for first-passage percolation on the configuration model ⋮ A functional central limit theorem for SI processes on configuration model graphs ⋮ Short paths for first passage percolation on the complete graph ⋮ Information Spreading in a Large Population of Active Transmitters and Passive Receivers ⋮ When is a scale-free graph ultra-small? ⋮ The winner takes it all but one ⋮ Long paths in first passage percolation on the complete graph II. Global branching dynamics ⋮ Flooding and diameter in general weighted random graphs ⋮ Random shortest paths: non-Euclidean instances for metric optimization problems ⋮ The duration of a supercritical \(\mathit{SIR}\) epidemic on a configuration model ⋮ Weighted distances in scale-free configuration models ⋮ A re-entrant phase transition in the survival of secondary infections on networks ⋮ Speeding up non-Markovian first-passage percolation with a few extra edges ⋮ Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs ⋮ Degree correlations in scale-free random graph models ⋮ Component structure of the configuration model: Barely supercritical case ⋮ Minimum weight disk triangulations and fillings

This page was built for publication: Universality for first passage percolation on sparse random graphs