Recurrence versus Transience for Weight-Dependent Random Connection Models

Abstract

We investigate random graphs on the points of a Poisson process in $d$-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point carries an independent random mark and given marks and positions of the points we form an edge between two points independently with a probability depending via a kernel on the two marks and the distance of the points. Different kernels allow the mark to play different roles, like weight, radius or birth time of a vertex. The kernels depend on a parameter~$\gamma$, which determines the power-law exponent of the degree distributions. A further independent parameter $\delta$ characterises the decay of the connection probabilities of vertices as their distance increases. We prove transience of the infinite cluster in the entire supercritical phase in regimes given by the parameters $\gamma$ and~$\delta$, and complement these results by recurrence results if $d=2$. Our results are particularly interesting for the soft Boolean graph model discussed in the preprint [arXiv:2108:11252] and the age-dependent random connection model recently introduced by Gracar et al.\ [Queueing Syst. 93.3-4 (2019)]}

32 pages. Version 4 contains several corrections, including a revised version of the recurrence result. arXiv admin note: text overlap with arXiv:math/0110296 by other authors

References in corpus (1)

• Percolation phase transition in weight-dependent random connection models

Cited by in corpus (13)

• Percolation phase transition in weight-dependent random connection models
• Not all interventions are equal for the height of the second peak
• Recurrence and transience of symmetric random walks with long-range jumps
• Scaling of the clustering function in spatial inhomogeneous random graphs
• Cluster-size decay in supercritical long-range percolation
• All spatial random graphs with weak long-range effects have chemical distance comparable to Euclidean distance
• Finiteness of the percolation threshold for inhomogeneous long-range models in one dimension
• Non-Uniqueness Phase in Hyperbolic Marked Random Connection Models using the Spherical Transform
• Graph distances in scale-free percolation: the logarithmic case
• Cover and Hitting Times of Hyperbolic Random Graphs
• Chemical distance in geometric random graphs with long edges and scale-free degree distribution
• Geometric random intersection graphs with general connection probabilities
• The contact process on scale-free geometric random graphs