Recurrence and transience of symmetric random walks with long-range jumps
arXiv:2209.09901 · doi:10.1214/23-EJP998
Abstract
Let be i.i.d. random variables with values in satisfying for some . We show that the random walk defined by is recurrent for and , and transient otherwise. This also shows that for an electric network in dimension the condition implies recurrence, whereas for some and implies transience. This fact was already previously known, but we give a new proof of it that uses only electric networks. We also use these results to show the recurrence of random walks on certain long-range percolation clusters. In particular, we show recurrence for several cases of the two-dimensional weight-dependent random connection model, which was previously studied by Gracar et al. [Electron. J. Probab. 27. 1-31 (2022)].
arXiv comment26 pages, 4 figures
References in corpus (8)
- Transience, Recurrence and Critical Behavior for Long-Range Percolation
- Spatial preferential attachment networks: Power laws and clustering coefficients
- Recurrence versus Transience for Weight-Dependent Random Connection Models
- The age-dependent random connection model
- Structures in supercritical scale-free percolation
- Percolation phase transition in weight-dependent random connection models
- Weighted distances in scale-free preferential attachment models
- Preferential attachment with location-based choice: Degree distribution in the noncondensation phase