{"paper":{"title":"Distances in critical long range percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Allan Sly, Jian Ding","submitted_at":"2013-03-16T16:14:05Z","abstract_excerpt":"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$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3995","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}