Distances in 1\|x-y\|^2d percolation models for all dimensions

Abstract: We study independent long-range percolation on

m a t h b b Z^{d}

for all dimensions

d

, where the vertices

u

and

v

are connected with probability 1 for

| u - v |_{i} n f t y = 1

and with probability

for

| u - v |_{i} n f t y g e q 2

. Let

u i n m a t h b b Z^{d}

be a point with

| u |_{i} n f t y = n

. We show that both the graph distance

D (m a t h b f 0, u)

between the origin

m a t h b f 0

and

u

and the diameter of the box

{0, l d o t s, n}^{d}

grow like

, where

. We also show that the graph distance and the diameter of boxes have the same asymptotic growth when two vertices

u, v

with

| u - v |_{2} > 1

are connected with a probability that is close enough to

. Furthermore, we determine the asymptotic behavior of

for large

, and we discuss the tail behavior of

.

Cites work

Cited in

(2)

This page was built for publication: Distances in \(\frac{1}{\|x-y\|^{2d}}\) percolation models for all dimensions