Scale-free percolation in continuum space: quenched degree and clustering coefficient

Abstract

Spatial random graphs capture several important properties of real-world networks. We prove quenched results for the continuum space version of scale-free percolation introduced in [DW18]. This is an undirected inhomogeneous random graph whose vertices are given by a Poisson point process in ${\mathbb{R}}^d$. Each vertex is equipped with a random weight and the probability that two vertices are connected by an edge depends on their weights and on their distance. Under suitable conditions on the parameters of the model, we show that, for almost all realizations of the point process, the degree distributions of all the nodes of the graph follow a power law with the same tail at infinity. We also show that the averaged clustering coefficient of the graph is self-averaging. In particular, it is almost surely equal to the the annealed clustering coefficient of one point, which is a strictly positive quantity.

arXiv comment20 pages

References in corpus (13)

• Emergence of scaling in random networks
• The structure and function of complex networks
• Epidemic spreading in scale-free networks
• The diameter of the world wide web
• Spatial Networks
• The complex network of global cargo ship movements
• Epidemics and percolation in small-world networks
• Fast Response and Temporal Coding on Coherent Oscillations in Small-World Networks
• On the scaling of the chemical distance in long-range percolation models
• Transience, Recurrence and Critical Behavior for Long-Range Percolation
• Spatial preferential attachment networks: Power laws and clustering coefficients
• Explosion in weighted Hyperbolic Random Graphs and Geometric Inhomogeneous Random Graphs
• Structures in supercritical scale-free percolation

Cited by in corpus (1)

• Graph distances in scale-free percolation: the logarithmic case