Scale-free network clustering in hyperbolic and other random graphs
arXiv:1812.03002 · doi:10.1088/1751-8121/ab2269
Abstract
Random graphs with power-law degrees can model scale-free networks as sparse topologies with strong degree heterogeneity. Mathematical analysis of such random graphs proved successful in explaining scale-free network properties such as resilience, navigability and small distances. We introduce a variational principle to explain how vertices tend to cluster in triangles as a function of their degrees. We apply the variational principle to the hyperbolic model that quickly gains popularity as a model for scale-free networks with latent geometries and clustering. We show that clustering in the hyperbolic model is non-vanishing and self-averaging, so that a single random graph sample is a good representation in the large-network limit. We also demonstrate the variational principle for some classical random graphs including the preferential attachment model and the configuration model.
References in corpus (34)
- Emergence of scaling in random networks
- Community structure in social and biological networks
- Epidemic spreading in scale-free networks
- The diameter of the world wide web
- The large-scale organization of metabolic networks
- Random graphs with arbitrary degree distributions and their applications
- Critical phenomena in complex networks
- Hierarchical Organization in Complex Networks
- Higher-order organization of complex networks
- Hyperbolic Geometry of Complex Networks
- Scale-Free Networks are Ultrasmall
- Large-scale topological and dynamical properties of Internet
- Absence of epidemic threshold in scale-free networks with connectivity correlations
- Pseudofractal Scale-free Web
- Properties of highly clustered networks
- Sustaining the Internet with Hyperbolic Mapping
- Class of correlated random networks with hidden variables
- Pattern Detection in Complex Networks: Correlation Profile of the Internet
- Generating simple random graphs with prescribed degree distribution
- Percolation and Epidemic Thresholds in Clustered Networks
- Network Cosmology
- Higher-order clustering in networks
- Diameters in preferential attachment models
- The hidden geometry of weighted complex networks
- Spatial preferential attachment networks: Power laws and clustering coefficients
- Degree and clustering coefficient in sparse random intersection graphs
- Deciphering the global organization of clustering in real complex networks
- Assortativity and clustering of sparse random intersection graphs
- Clustering of random scale-free networks
- Hyperbolicity Measures "Democracy" in Real-World Networks
- Local clustering in scale-free networks with hidden variables
- Clustering Spectrum of scale-free networks
- Triadic closure in configuration models with unbounded degree fluctuations
- Fluctuations analysis in complex networks modeled by hidden variable models. Necessity of a large cut-off in hidden-variable models