 0479 Marek Biskup
 On the scaling of the chemical distance in longrange percolation models
(288K, PDF)
Mar 12, 04

Abstract ,
Paper (src),
View paper
(auto. generated pdf),
Index
of related papers

Abstract. We consider the (unoriented) longrange percolation on~$\Z^d$ in dimensions~$d\ge1$, where distinct sites~$x,y\in\Z^d$ get connected with probability~$p_{xy}\in[0,1]$. Assuming~$p_{xy}=xy^{s+o(1)}$ as~$xy\to\infty$, where~$s>0$ and~$\cdot$ is a norm distance on~$\Z^d$, and supposing that the resulting random graph contains an infinite connected component~$\scrC_\infty$, we let~$D(x,y)$ be the graph distance between~$x$ and~$y$ measured on~$\scrC_\infty$.
Our main result is that, for~$s\in(d,2d)$,
$$
D(x,y)=(\logxy)^{\Delta+o(1)},
\qquad x,y\in \scrC_\infty,\,\,xy\to\infty,
$$
where~$\Delta^{1}$ is the binary logarithm of~$2d/s$ and~$o(1)$ is a quantity tending to zero in probability as $xy\to\infty$.
Besides its interest for general percolation theory, this result sheds some light on a question that has recently surfaced in the context of ``smallworld'' phenomena. As part of the proof we also establish tight bounds on the probability that the largest connected component in a finite box contains a positive fraction of all sites in the box.
 Files:
0479.src(
0479.comments ,
0479.keywords ,
LRPfinal.pdf.mm )