Scale-free network clustering in hyperbolic and other random graphs

DOI10.1088/1751-8121/AB2269MaRDI QIDQ5055677zbMATH OpenOpenAlexWikidataFDO

Authors Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden

Publication date 9 December 2022

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.03002

zbMATH Keywords

clusteringcomplex networkshyperbolic modelrandom graphs

Mathematics Subject Classification ID

Quantum theory (81-XX) Statistical mechanics, structure of matter (82-XX)

Recommendations

• Clustering and the hyperbolic geometry of complex networks
• Random hyperbolic graphs: degree sequence and clustering (extended abstract)
• Clustering in a hyperbolic model of complex networks
• Clustering and the hyperbolic geometry of complex networks
• Cliques in hyperbolic random graphs

Cites work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A spatial web graph model with local influence regions
• Assortativity and clustering of sparse random intersection graphs
• Community structure in social and biological networks
• Degree and clustering coefficient in sparse random intersection graphs
• Diameters in preferential attachment models
• Distances in random graphs with finite mean and infinite variance degrees
• Efficient shortest paths in scale-free networks with underlying hyperbolic geometry
• Emergence of Scaling in Random Networks
• Generating simple random graphs with prescribed degree distribution
• scientific article; zbMATH DE number 1175490 (Why is no real title available?)
• On percolation in random graphs with given vertex degrees
• On Random Intersection Graphs: The Subgraph Problem
• On the diameter of hyperbolic random graphs
• On the largest component of a hyperbolic model of complex networks
• Popularity based random graph models leading to a scale-free degree sequence
• Random graphs and complex networks. Volume 1
• Random hyperbolic graphs: degree sequence and clustering (extended abstract)
• Spatial preferential attachment networks: power laws and clustering coefficients
• The average distances in random graphs with given expected degrees
• Triadic closure in configuration models with unbounded degree fluctuations
• Typical distances in ultrasmall random networks

Cited in

(13)

• Clustering in a hyperbolic model of complex networks
• Not all interventions are equal for the height of the second peak
• Clustering and the hyperbolic geometry of complex networks
• Global Clustering Coefficient in Scale-Free Networks
• Random hyperbolic graphs: degree sequence and clustering (extended abstract)
• Parameterized Clique on Scale-Free Networks
• Scale-free percolation in continuous space: quenched degree and clustering coefficient
• Statistical Clustering of a Random Network by Extremal Properties
• Clustering in preferential attachment random graphs with edge-step
• New cut-balance conditions in networks of clusters
• Clustering and the hyperbolic geometry of complex networks
• Scaling of the clustering function in spatial inhomogeneous random graphs
• Clustering and cliques in preferential attachment random graphs with edge insertion

This page was built for publication: Scale-free network clustering in hyperbolic and other random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055677)