Scale-free percolation in continuous space: quenched degree and clustering coefficient
From MaRDI portal
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 . 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.
Recommendations
Cites work
- An Introduction to the Theory of Point Processes
- Bootstrap percolation and the geometry of complex networks
- Collective dynamics of `small-world' networks
- Emergence of Scaling in Random Networks
- Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
- Geometric inhomogeneous random graphs
- How Clustering Affects Epidemics in Random Networks
- scientific article; zbMATH DE number 2042687 (Why is no real title available?)
- scientific article; zbMATH DE number 227027 (Why is no real title available?)
- scientific article; zbMATH DE number 5070369 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- On a conditionally Poissonian graph process
- On the scaling of the chemical distance in long-range percolation models
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Random graph models of social networks
- Random graphs and complex networks. Volume 1
- Random hyperbolic graphs: degree sequence and clustering (extended abstract)
- Scale-free network clustering in hyperbolic and other random graphs
- Scale-free percolation
- Scale-free percolation in continuum space
- Spatial preferential attachment networks: power laws and clustering coefficients
- Structures in supercritical scale-free percolation
- The age-dependent random connection model
- The average distances in random graphs with given expected degrees
- The Structure and Function of Complex Networks
- Transience, recurrence and critical behavior for long-range percolation
- Ultra-small scale-free geometric networks
Cited in
(8)- Structures in supercritical scale-free percolation
- Robustness of scale-free spatial networks
- Scale-free percolation in continuum space
- Graph distances in scale-free percolation: the logarithmic case
- Local limits of spatial inhomogeneous random graphs
- Scaling of the clustering function in spatial inhomogeneous random graphs
- Scale-free percolation mixing time
- Branching processes and homogenization for epidemics on spatial random graphs
This page was built for publication: Scale-free percolation in continuous space: quenched degree and clustering coefficient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964783)