On the scaling of the chemical distance in long-range percolation models

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published at http://dx.doi.org/10.1214/009117904000000577 in the Annals of Probability (http://www.imstat.org/aop/) by the Ins

Scientific paper

10.1214/009117904000000577

We consider the (unoriented) long-range 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}=|x-y|^{-s+o(1)} as |x-y|\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 C_{\infty}, we let D(x,y) be the graph distance between x and y measured on C_{\infty}. Our main result is that, for s\in(d,2d), D(x,y)=(\log|x-y|)^{\Delta+o(1)},\qquad x,y\in C_{\infty}, |x-y|\to\infty, where \Delta^{-1} is the binary logarithm of 2d/s and o(1) is a quantity tending to zero in probability as |x-y|\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 ``small-world'' 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the scaling of the chemical distance in long-range percolation models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the scaling of the chemical distance in long-range percolation models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the scaling of the chemical distance in long-range percolation models will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-266517

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.