Percolation-like Scaling Exponents for Minimal Paths and Trees in the Stochastic Mean Field Model
arXiv:cond-mat/0501473 · doi:10.1098/rspa.2004.1388
Abstract
In the mean field (or random link) model there are points and inter-point distances are independent random variables. For and in the limit, let (maximum number of steps in a path whose average step-length is ). The function is analogous to the percolation function in percolation theory: there is a critical value at which becomes non-zero, and (presumably) a scaling exponent in the sense . Recently developed probabilistic methodology (in some sense a rephrasing of the cavity method of Mezard-Parisi) provides a simple albeit non-rigorous way of writing down such functions in terms of solutions of fixed-point equations for probability distributions. Solving numerically gives convincing evidence that . A parallel study with trees instead of paths gives scaling exponent . The new exponents coincide with those found in a different context (comparing optimal and near-optimal solutions of mean-field TSP and MST) and reinforce the suggestion that these scaling exponents determine universality classes for optimization problems on random points.
19 pages
References in corpus (4)
Cited by in corpus (6)
- A survey of max-type recursive distributional equations
- Analytical calculation of neighborhood order probabilities for high dimensional Poissonic processes and mean field models
- An efficient algorithm to generate large random uncorrelated Euclidean distances: the random link model
- Replica Symmetry and Combinatorial Optimization
- Percolation of averages in the stochastic mean field model: the near-supercritical regime
- Percolating paths through random points :