1. Scale-free percolation in continuous space: quenched degree and clustering coefficient
- Author
-
Joseba Dalmau and Michele Salvi
- Subjects
Statistics and Probability ,General Mathematics ,Random graph ,scale-free percolation ,degree distribution ,clustering coefficient ,small world ,Poisson point process ,self-averaging ,01 natural sciences ,Point process ,Combinatorics ,010104 statistics & probability ,Almost surely ,0101 mathematics ,Clustering coefficient ,Mathematics ,Degree (graph theory) ,010102 general mathematics ,Degree distribution ,Settore MAT/06 ,Graph (abstract data type) ,Statistics, Probability and Uncertainty - Abstract
Spatial random graphs capture several important properties of real-world networks. We prove quenched results for the continuous-space version of scale-free percolation introduced in [14]. 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 isself-averaging. In particular, it is almost surely equal to the annealed clustering coefficient of one point, which is a strictly positive quantity.
- Published
- 2021
- Full Text
- View/download PDF