Scaling of the clustering function in spatial inhomogeneous random graphs

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.

arXiv comment37 pages, 6 figures, 1 table

References in corpus (14)

• Hyperbolic Geometry of Complex Networks
• Large-scale topological and dynamical properties of Internet
• The phase transition in inhomogeneous random graphs
• Properties of highly clustered networks
• Network Geometry
• Clustering in complex networks. I. General formalism
• Structure of a large social network
• Spatial preferential attachment networks: Power laws and clustering coefficients
• 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
• Detecting hyperbolic geometry in networks: why triangles are not enough
• Scale-free network clustering in hyperbolic and other random graphs