Arithmetic oscillations of the chemical distance in long-range percolation on
arXiv:2112.12365 · doi:10.1214/23-AAP2031
Abstract
We consider a long-range percolation graph on where, in addition to the nearest-neighbor edges of , distinct are connected by an edge independently with probability asymptotic to , for , and a norm on . We first show that, for all but a countably many , the graph-theoretical (a.k.a. chemical) distance between typical vertices at -distance is, with high probability as , asymptotic to , where and is a positive, bounded and continuous function subject to for . The proof parallels that in a continuum version of the model where a similar scaling was shown earlier by the first author and J. Lin. This work also conjectured that is constant which we show to be false by proving that tends, as , to a non-constant limit which is independent of the specifics of the model. The proof reveals arithmetic rigidity of the shortest paths that maintain a hierarchical (dyadic) structure all the way to unit scales.
arXiv comment32 pages, 2 figures, typos corrected, proofs expanded
References in corpus (10)
- On the scaling of the chemical distance in long-range percolation models
- Transience, Recurrence and Critical Behavior for Long-Range Percolation
- The growth of the infinite long-range percolation cluster
- Graph diameter in long-range percolation
- Structures in supercritical scale-free percolation
- A lower bound for the chemical distance in sparse long-range percolation models
- Distances in critical long range percolation
- Sharp asymptotic for the chemical distance in long-range percolation
- Distances in percolation models for all dimensions
- A sharp leading order asymptotic of the diameter of a long range percolation graph