Shortest-Weight Paths in Random Regular Graphs

DOI10.1137/120899534zbMath1303.05174arXiv1210.2657OpenAlexW1996534617MaRDI QIDQ3192154

Yuval Peres, Hamed Amini

Publication date: 26 September 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

law of large numbersrandom regular graphsshortest pathsfirst passage percolationweighted random graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 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 (3)

Long paths in first passage percolation on the complete graph II. Global branching dynamics ⋮ Diameter of the Stochastic Mean-Field Model of Distance ⋮ The diameter of weighted random graphs

This page was built for publication: Shortest-Weight Paths in Random Regular Graphs