Distances in percolation models for all dimensions
arXiv:2208.04800 · doi:10.1007/s00220-023-04861-z
Abstract
We study independent long-range percolation on for all dimensions , where the vertices and are connected with probability 1 for and with probability for . Let be a point with . We show that both the graph distance between the origin and and the diameter of the box grow like , where . We also show that the graph distance and the diameter of boxes have the same asymptotic growth when two vertices with are connected with a probability that is close enough to . Furthermore, we determine the asymptotic behavior of for large , and we discuss the tail behavior of .
arXiv comment70 pages, 9 figures
References in corpus (8)
- On the scaling of the chemical distance in long-range percolation models
- Critical random graphs: Diameter and mixing time
- Transience, Recurrence and Critical Behavior for Long-Range Percolation
- On chemical distances and shape theorems in percolation models with long-range correlations
- Large deviations for the chemical distance in supercritical Bernoulli percolation
- Graph diameter in long-range percolation
- Sharp asymptotic for the chemical distance in long-range percolation
- Sharp hierarchical upper bounds on the critical two-point function for long-range percolation on