Communications in Mathematical Physics

, Volume 226, Issue 3, pp 531-558

First online:

Transience, Recurrence and Critical Behavior¶for Long-Range Percolation

  • Noam BergerAffiliated withDepartment of Statistics, The University of California, Berkeley, CA 94720-3860, USA.¶E-mail: noam@stat.berkeley.edu

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract:

We study the behavior of the random walk on the infinite cluster of independent long-range percolation in dimensions d= 1,2, where x and y are connected with probability \(\). We show that if d<s<2d, then the walk is transient, and if s≥ 2d, then the walk is recurrent. The proof of transience is based on a renormalization argument. As a corollary of this renormalization argument, we get that for every dimension d≥ 1, if d>s>2d, then there is no infinite cluster at criticality. This result is extended to the free random cluster model. A second corollary is that when d≥& 2 and d>s>2d we can erase all long enough bonds and still have an infinite cluster. The proof of recurrence in two dimensions is based on general stability results for recurrence in random electrical networks. In particular, we show that i.i.d. conductances on a recurrent graph of bounded degree yield a recurrent electrical network.