Shortest-Weight Paths in Random Regular Graphs

From MaRDI portal
Publication:3192154

DOI10.1137/120899534zbMATH Open1303.05174arXiv1210.2657OpenAlexW1996534617MaRDI QIDQ3192154FDOQ3192154

Yuval Peres, Hamed Amini

Publication date: 26 September 2014

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

Abstract: Consider a random regular graph with degree d and of size n. Assign to each edge an i.i.d. exponential random variable with mean one. In this paper we establish a precise asymptotic expression for the maximum number of edges on the shortest-weight paths between a fixed vertex and all the other vertices, as well as between any pair of vertices. Namely, for any fixed dgeq3, we show that the longest of these shortest-weight paths has about hatalphalogn edges where hatalpha is the unique solution of the equation alphalog(fracd2d1alpha)alpha=fracd3d2, for alpha>fracd1d2.


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






Cited In (7)






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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192154)