Distances in critical long range percolation

MaRDI QIDQ6240387zbMATH OpenFDO

Authors Jian Ding, Allan Sly

Publication date 16 March 2013

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Renormalization group methods in equilibrium statistical mechanics (82B28) Percolation (82B43)

Abstract: We study the long range percolation model on $mathbbZ$ where sites $i$ and $j$ are connected with probability $$. 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 $$ up to a multiplicative constant for some exponent $$ as does the diameter of the graph on a box of length $n$.

This page was built for publication: Distances in critical long range percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6240387)