First passage percolation on locally treelike networks. I. Dense random graphs

DOI10.1063/1.3039876zbMath1159.81304OpenAlexW2013240448MaRDI QIDQ3624678

Shankar Bhamidi

Publication date: 30 April 2009

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/baef2da43fb53cc5f148df97fb9b9a99f94a6106

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Related Items (14)

Local neighbourhoods for first-passage percolation on the configuration model ⋮ Multiple Phase Transitions in Long-Range First-Passage Percolation on Square Lattices ⋮ Short paths for first passage percolation on the complete graph ⋮ Information Spreading in a Large Population of Active Transmitters and Passive Receivers ⋮ Weak disorder asymptotics in the stochastic mean-field model of distance ⋮ Diameter of the Stochastic Mean-Field Model of Distance ⋮ First passage percolation on random graphs with finite mean degrees ⋮ Edge flows in the complete random-lengths network ⋮ Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks ⋮ Competing first passage percolation on random regular graphs ⋮ First Passage Percolation on the Erdős–Rényi Random Graph ⋮ Joint Distribution of Distances in Large Random Regular Networks ⋮ First Passage Percolation on Inhomogeneous Random Graphs ⋮ The diameter of weighted random graphs

Cites Work

• Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
• First-passage percolation on the square lattice
• Distances in random graphs with finite mean and infinite variance degrees
• 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX)
• An efficient algorithm for K shortest simple paths
• One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
• Distances in random graphs with finite variance degrees

This page was built for publication: First passage percolation on locally treelike networks. I. Dense random graphs