Open Access
Translator Disclaimer
2022 Recurrence versus transience for weight-dependent random connection models
Peter Gracar, Markus Heydenreich, Christian Mönch, Peter Mörters
Author Affiliations +
Electron. J. Probab. 27: 1-31 (2022). DOI: 10.1214/22-EJP748

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 γ, which determines the power-law exponent of the degree distributions. A further independent parameter δ 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 γ and δ, 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)]

Funding Statement

We acknowledge support from DFG through the scientific network Stochastic Processes on Evolving Networks. The research of CM is funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 443916008/SPP2265.

Acknowledgments

We thank Noam Berger for correspondence concerning the recurrence results.

Citation

Download Citation

Peter Gracar. Markus Heydenreich. Christian Mönch. Peter Mörters. "Recurrence versus transience for weight-dependent random connection models." Electron. J. Probab. 27 1 - 31, 2022. https://doi.org/10.1214/22-EJP748

Information

Received: 27 November 2019; Accepted: 30 January 2022; Published: 2022
First available in Project Euclid: 6 May 2022

Digital Object Identifier: 10.1214/22-EJP748

Subjects:
Primary: 05C80 , 60K35

Keywords: Boolean model , preferential attachment , random-connection model , recurrence , Scale-free percolation , transience

JOURNAL ARTICLE
31 PAGES


SHARE
Vol.27 • 2022
Back to Top