REVIEW 3 cited by
Distances in critical long range percolation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
We study the long range percolation model on $\mathbb{Z}$ where sites $i$ and $j$ are connected with probability $\beta |i-j|^{-s}$. Graph distances are now well understood for all exponents $s$ except in the case $s=2$ where the model exhibits non-trivial self-similar scaling. Establishing a conjecture of Benjamini and Berger \cite{BenBer:01}, we prove that the typical distance from site 0 to $n$ grows as a power law $n^{\theta(\beta)}$ up to a multiplicative constant for some exponent $0<\theta(\beta)<1$ as does the diameter of the graph on a box of length $n$.
Forward citations
Cited by 3 Pith papers
-
Rainbow percolation
The continuum random connection model at critical inverse-square decay percolates for λβ≥31 and fragments for λβ<1, while its integer-lattice version never percolates at all.
-
Uniqueness and dimension for the geodesic of the critical long-range percolation metric
For the critical long-range percolation metric, geodesics are almost surely unique and every geodesic has Hausdorff dimension equal to the distance exponent theta.
-
The polynomial growth of effective resistances in one-dimensional critical long-range percolation
Effective resistances in one-dimensional critical long-range percolation grow as n^{δ(β)} for some δ(β) in (0,1).
Discussion (0). Continue with ORCID to comment.