Finiteness of the percolation threshold for inhomogeneous long-range models in one dimension

Abstract

We consider inhomogeneous spatial random graphs on the real line. Each vertex carries an i.i.d. weight and edges are drawn such that short edges and edges to vertices with large weights occur with higher probability. This allows the study of models with long-range effects and heavy-tailed degree distributions. We introduce a new coefficient ${\delta }_{\text{eff}}$ which quantifies the influence of heavy-tailed degrees on long-range connections. We show that ${\delta }_{\text{eff}}<2$ is sufficient for the existence of a supercritical percolation phase in the model and that ${\delta }_{\text{eff}}>2$ always implies the absence of percolation. In particular, our results complement those in Gracar et al. (Adv. Appl. Prob., 2021), where sufficient conditions were given for the soft Boolean model and the age-dependent random connection model for both the existence and the absence of a subcritical percolation phase. Our results further provide a criterion for the existence or non-existence of a giant component in large finite graphs.

References in corpus (9)

• The phase transition in inhomogeneous random graphs
• Large deviations for random walks under subexponentiality: the big-jump domain
• Connectivity of soft random geometric graphs
• Subcritical regimes in the Poisson Boolean model of continuum percolation
• Explosion in weighted Hyperbolic Random Graphs and Geometric Inhomogeneous Random Graphs
• Recurrence versus Transience for Weight-Dependent Random Connection Models
• The age-dependent random connection model
• Percolation phase transition in weight-dependent random connection models
• Generating Galton-Watson trees using random walks and percolation for the Gaussian free field

Cited by in corpus (1)

• All spatial random graphs with weak long-range effects have chemical distance comparable to Euclidean distance