Sharp asymptotic for the chemical distance in long-range percolation
arXiv:1705.10380 · doi:10.1002/rsa.20849
Abstract
We consider instances of long-range percolation on and , where points at distance get connected by an edge with probability proportional to , for , and study the asymptotic of the graph-theoretical (a.k.a. chemical) distance between and in the limit as . For the model on we show that, in probability as , the distance is squeezed between two positive multiples of , where for . For the model on we show that is, in probability as for any nonzero , asymptotic to for a positive, continuous (deterministic) function obeying for all . The proof of the asymptotic scaling is based on a subadditive argument along a continuum of doubly-exponential sequences of scales. The results strengthen considerably the conclusions obtained earlier by the first author. Still, significant open questions remain.
arXiv comment22 pages, 2 figs
References in corpus (4)
Cited by in corpus (11)
- Small worlds and clustering in spatial networks
- Extended-range percolation in complex networks
- Distances in percolation models for all dimensions
- Quenched Invariance Principle for a class of random conductance models with long-range jumps
- Arithmetic oscillations of the chemical distance in long-range percolation on
- The longest edge of the one-dimensional soft random geometric graph with boundaries
- Behavior of the distance exponent for long-range percolation
- Graph distances of continuum long-range percolation
- Chemical distance in geometric random graphs with long edges and scale-free degree distribution
- The longest edge in discrete and continuous long-range percolation
- Continuity of the critical value and a shape theorem for long-range percolation