Scaling of the clustering function in spatial inhomogeneous random graphs
From MaRDI portal
Abstract: We consider an infinite spatial inhomogeneous random graph model with an integrable connection kernel that interpolates nicely between existing spatial random graph models. Key examples are versions of the weight-dependent random connection model, the infinite geometric inhomogeneous random graph, and the age-based random connection model. These infinite models arise as the local limit of the corresponding finite models, see cite{LWC_SIRGs_2020}. For these models we identify the scaling of the emph{local clustering} as a function of the degree of the root in different regimes in a unified way. We show that the scaling exhibits phase transitions as the interpolation parameter moves across different regimes. In addition to the scaling we also identify the leading constants of the clustering function. This allows us to draw conclusions on the geometry of a emph{typical} triangle contributing to the clustering in the different regimes.
Recommendations
Cites work
- Clustering Properties of Spatial Preferential Attachment Model
- Clustering and percolation on superpositions of Bernoulli random graphs
- Clustering in a hyperbolic model of complex networks
- Continuum Percolation
- Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
- Geometric inhomogeneous random graphs
- Latent Space Approaches to Social Network Analysis
- Lectures on the Poisson Process
- Local limits of spatial inhomogeneous random graphs
- Random graphs and complex networks. Volume 1
- Recurrence versus transience for weight-dependent random connection models
- Sampling geometric inhomogeneous random graphs in linear time
- Scale-free network clustering in hyperbolic and other random graphs
- Spatial preferential attachment networks: power laws and clustering coefficients
- Subcritical regimes in the Poisson Boolean model of continuum percolation
- The age-dependent random connection model
- The phase transition in inhomogeneous random graphs
Cited in
(9)- Poisson approximation of fixed-degree nodes in weighted random connection models
- Cluster tails for critical power-law inhomogeneous random graphs
- Condensation in scale-free geometric graphs with excess edges
- The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects
- Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs
- Limit theorems under heavy-tailed scenario in the age-dependent random connection models
- Geometric random graphs vs inhomogeneous random graphs
- Cluster-size decay in supercritical kernel-based spatial random graphs
- On the topology of higher-order age-dependent random connection models
This page was built for publication: Scaling of the clustering function in spatial inhomogeneous random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133276)
