First passage percolation on random graphs with finite mean degrees

DOI10.1214/09-AAP666zbMath1213.60157arXiv0903.5136MaRDI QIDQ1958506

Gerard Hooghiemstra, Shankar Bhamidi, Remco van der Hofstad

Publication date: 4 October 2010

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

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

zbMATH Keywords

random graphs central limit theorem first passage percolation minimum weight path

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

Sample size recommendation for a bioequivalent study, 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, Multiple Phase Transitions in Long-Range First-Passage Percolation on Square Lattices, Interacting particle systems as stochastic social dynamics, Information Spreading in a Large Population of Active Transmitters and Passive Receivers, Ising models on power-law random graphs, When is a scale-free graph ultra-small?, Weak disorder asymptotics in the stochastic mean-field model of distance, The winner takes it all but one, Long paths in first passage percolation on the complete graph II. Global branching dynamics, Weak disorder in the stochastic mean-field model of distance. II, Diameter of the Stochastic Mean-Field Model of Distance, Minimum-weight combinatorial structures under random cost-constraints, Flooding and diameter in general weighted random graphs, Tight fluctuations of weight-distances in random graphs with infinite-variance degrees, Asymptotic Behaviour of Gossip Processes and Small-World Networks, Random shortest paths: non-Euclidean instances for metric optimization problems, On the Markov Transition Kernels for First Passage Percolation on the Ladder, Diameters in Supercritical Random Graphs Via First Passage Percolation, Weighted distances in scale-free configuration models, Epidemics and vaccination on weighted graphs, Nonuniversality of weighted random graphs with infinite variance degree, Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks, Kardar–Parisi–Zhang universality in first-passage percolation: the role of geodesic degeneracy, Speeding up non-Markovian first-passage percolation with a few extra edges, Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs, First passage percolation on sparse random graphs with boundary weights, Competing first passage percolation on random regular graphs, Anatomy of a young giant component in the random graph, First Passage Percolation on the Erdős–Rényi Random Graph, The Effect of Adding Randomly Weighted Edges, Infinite paths on a random environment of \({\mathbb{Z}}^2\) with bounded and recurrent sums, Couplings for locally branching epidemic processes, The front of the epidemic spread and first passage percolation, Joint Distribution of Distances in Large Random Regular Networks, First Passage Percolation on Inhomogeneous Random Graphs, The diameter of weighted random graphs, Distance evolutions in growing preferential attachment graphs, Degree distribution of shortest path trees and bias of network sampling algorithms

Cites Work