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 LWCSIRGs2020. For these models we identify the scaling of the 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 typical triangle contributing to the clustering in the different regimes.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.