Transience, Recurrence and Critical Behavior for Long-Range Percolation
arXiv:math/0110296 · doi:10.1007/s002200200617
Abstract
We study the behavior of the random walk on the infinite cluster of independent long range percolation in dimensions , where and a re connected with probability . We show that when the walk is transient, and when , 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 , if , then critical percolation has no infinite clusters. This result is extended to the free random cluster model. A second corollary is that when and 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.
Mario Wuetrich pointed out a gap in one of the proofs in this (more than 10 years) old paper. Here is the corrected version. 43 pages, no figures
References in corpus (2)
Cited by in corpus (48)
- Quenched invariance principle for simple random walk on percolation clusters
- On the scaling of the chemical distance in long-range percolation models
- Mean-field driven first-order phase transitions in systems with long-range interactions
- Mean-field behavior for long- and finite range Ising model, percolation and self-avoiding walk
- The growth of the infinite long-range percolation cluster
- Recurrence versus Transience for Weight-Dependent Random Connection Models
- Graph diameter in long-range percolation
- Recurrence of bipartite planar maps
- Structures in supercritical scale-free percolation
- A lower bound for the chemical distance in sparse long-range percolation models
- Condenser physics applied to Markov chains - A brief introduction to potential theory
- Sharp asymptotic for the chemical distance in long-range percolation
- Long-range percolation on the hierarchical lattice
- Sharp hierarchical upper bounds on the critical two-point function for long-range percolation on
- On the Truncation of Systems with Non-Summable Interactions
- Infinite randomness critical behavior of the contact process on networks with long-range connections
- Competition between quenched disorder and long-range connections: A numerical study of diffusion
- Random Conductance Models with Stable-like Jumps: Quenched Invariance Principle
- Random walks in random environments without ellipticity
- Heat Kernel Upper Bounds on Long Range Percolation Clusters
- Central Limit Theorem and recurrence for random walks in bistochastic random environments
- Recurrence and transience of symmetric random walks with long-range jumps
- Distances in percolation models for all dimensions
- Behavior of random walk on discrete point processes
- Ergodic Theory on Stationary Random Graphs
- Arithmetic oscillations of the chemical distance in long-range percolation on
- The critical two-point function for long-range percolation on the hierarchical lattice
- Truncated long-range percolation on oriented graphs
- Random walk on discrete point processes
- The random walk on the random connection model
- Percolation in an ultrametric space
- Behavior of the distance exponent for long-range percolation
- Isoperimetric lower bounds for critical exponents for long-range percolation
- A note on truncated long-range percolation with heavy tails on oriented graphs
- On the speed of Random Walks among Random Conductances
- Scale-free percolation in continuum space: quenched degree and clustering coefficient
- Recurrence and transience for long-range reversible random walks on a random point process
- Heat kernel estimates for strongly recurrent random walk on random media
- Truncation of long-range percolation model with square non-summable interactions
- Simple Random Walk on Long Range Percolation Clusters II: Scaling Limits
- The Diameter of Long-Range Percolation Clusters on Finite Cycles
- Transience and recurrence of random walks on percolation clusters in an ultrametric space
- Inhomogeneous Long-Range Percolation for Real-Life Network Modeling
- omega-Periodic graphs
- Continuity of the critical value and a shape theorem for long-range percolation
- The longest edge in discrete and continuous long-range percolation
- Detecting the trail of a random walker in a random scenery
- Scale-free percolation