Percolation of averages in the stochastic mean field model: the near-supercritical regime
From MaRDI portal
Publication:894189
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).
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
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)