A lower bound for the chemical distance in sparse long-range percolation models

Details A lower bound for the chemical distance in sparse long-range percolation models A lower bound for the chemical distance in sparse long-range percolation models

2004-09-01

arxiv.org/abs/math/0409021v1

Mathematics

Probability

9 pages

Scientific paper

We consider long-range percolation in dimension $d\geq 1$, where distinct
sites $x$ and $y$ are connected with probability $p_{x,y}\in[0,1]$. Assuming
that $p_{x,y}$ is translation invariant and that $p_{x,y}=\|x-y\|^{-s+o(1)}$
with $s>2d$, we show that the graph distance is at least linear with the
Euclidean distance.

Affiliated with

Also associated with

No associations

Rating

A lower bound for the chemical distance in sparse 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 A lower bound for the chemical distance in sparse long-range percolation models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A lower bound for the chemical distance in sparse long-range percolation models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-172121