Long Paths in First Passage Percolation on the Complete Graph II. Global Branching Dynamics
- PDF / 1,371,717 Bytes
- 84 Pages / 439.37 x 666.142 pts Page_size
- 50 Downloads / 164 Views
Long Paths in First Passage Percolation on the Complete Graph II. Global Branching Dynamics Maren Eckhoff1 · Jesse Goodman2 Francesca R. Nardi3
· Remco van der Hofstad3
·
Received: 15 November 2019 / Accepted: 2 June 2020 / Published online: 6 August 2020 © The Author(s) 2020
Abstract 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˝os–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 (sn )n≥1 that characterises the different universality classes for first passage percolation on the complete graph. We investigate the case where sn → ∞ with sn = 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 sn log (n/sn3 ) and variance sn2 log (n/sn3 ). Remarkably, our proof also applies to n-dependent edge weights of the form E sn , 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. Local PWIT dynamics. Electron. J. Probab. 25:1–45, 2020. https://doi.org/10.1214/20-EJP484); the current paper focuses on the global branching dynamics. Keywords First-passage percolation · Stochastic mean-field model of distance · Strong disorder · Continuous-time branching processes · Invasion percolation
Communicated by Hal Tasaki. Extended author information available on the last page of the article
123
Long Paths in First Passage Percolation...
365
Contents 1 Model and Summary of Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.1 First Passage Percolation with Regularly-Varying Edge Weights . . . . . . . . 1.2 First Passage Percolation with n-Dependent Edge Weights . . . . . . . . . . . 2 The Universal Picture . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Data Loading...
