Computing the clustering coefficient of a random model of graphs

zbMATH Open1098.05505MaRDI QIDQ5486024FDOQ5486024

Authors: Hongwei Zhou, Xianmin Geng 

Publication date: 6 September 2006

Recommendations

• Clustering and the hyperbolic geometry of complex networks
• Clustering and the hyperbolic geometry of complex networks
• The clustering coefficient of a scale-free random graph
• Clustering Coefficients of Random Intersection Graphs

zbMATH Keywords

random graphprobabilitydegree distribution

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Cited In (4)

• Model-based clustering for random hypergraphs
• Clustering and the hyperbolic geometry of complex networks
• Clustering Coefficients of Random Intersection Graphs
• Estimating the clustering coefficient using sample complexity analysis

This page was built for publication: Computing the clustering coefficient of a random model of graphs

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