Percolation of averages in the stochastic mean field model: the near-supercritical regime
From MaRDI portal
Publication:894189
DOI10.1214/EJP.V20-4111zbMATH Open1328.60018arXiv1501.03579OpenAlexW1587386692MaRDI QIDQ894189FDOQ894189
Authors: Jian Ding, S. Goswami
Publication date: 27 November 2015
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Abstract: For a complete graph of size , assign each edge an i.i.d. exponential variable with mean . For , consider the length of the longest path whose average weight is at most . It was shown by Aldous (1998) that the length is of order for and of order for . In this paper, we study the near-supercritical regime where with a small fixed number. We show that there exist two absolute constants such that with high probability the length is in between and . Our result corrects a non-rigorous prediction of Aldous (2005).
Full work available at URL: https://arxiv.org/abs/1501.03579
Recommendations
- Scaling window for mean-field percolation of averages
- Diameter of the stochastic mean-field model of distance
- On the Critical Value for ‘Percolation’ of Minimum-Weight Trees in the Mean-Field Distance Model
- Weak disorder in the stochastic mean-field model of distance. II
- The longest minimum-weight path in a complete graph
Extreme value theory; extremal stochastic processes (60G70) Combinatorial optimization (90C27) Combinatorial probability (60C05) Percolation (82B43)
Cited In (4)
This page was built for publication: Percolation of averages in the stochastic mean field model: the near-supercritical regime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894189)