First Passage Percolation on the Newman–Watts Small World Model

Komjáthy, Júlia; Vadon, Viktória

doi:10.1007/s10955-015-1442-3

Cited by 1 publication

(1 citation statement)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Related results for exponential edge weights appear for the Erdős–Rényi random graph in [ 15 ], to certain inhomogeneous random graphs in [ 28 ] and to the small-world model in [ 30 ]. The diameter of the weighted graph is studied in [ 6 ], and relations to competition on r -regular graphs are examined in [ 7 ].…”

Section: The Universal Picturementioning

confidence: 99%

Long Paths in First Passage Percolation on the Complete Graph II. Global Branching Dynamics

et al. 2020

View full text Add to dashboard Cite

We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed positive edge weights. We consider the case where the lower extreme values of the edge weights are highly separated. This model exhibits strong disorder and a crossover between local and global scales. Local neighborhoods are related to invasion percolation that display self-organised criticality. Globally, the edges with relevant edge weights form a barely supercritical Erdős-Rényi random graph that can be described by branching processes. This near-critical behaviour gives rise to optimal paths that are considerably longer than logarithmic in the number of vertices, interpolating between random graph and minimal spanning tree path lengths. Crucial to our approach is the quantification of the extreme-value behavior of small edge weights in terms of a sequence of parameters (s n) n≥1 that characterises the different universality classes for first passage percolation on the complete graph. We investigate the case where s n → ∞ with s n = o(n 1/3), which corresponds to the barely supercritical setting. We identify the scaling limit of the weight of the optimal path between two vertices, and we prove that the number of edges in this path obeys a central limit theorem with mean approximately s n log (n/s 3 n) and variance s 2 n log (n/s 3 n). Remarkably, our proof also applies to n-dependent edge weights of the form E s n , where E is an exponential random variable with mean 1, thus settling a conjecture of Bhamidi et al. (Weak disorder asymptotics in the stochastic meanfield model of distance. Ann Appl Probab 22(1):29-69, 2012). The proof relies on a decomposition of the smallest-weight tree into an initial part following invasion percolation dynamics, and a main part following branching process dynamics. The initial part has been studied in Eckhoff et al. (Long paths in first passage percolation on the complete graph I.

show abstract