The clustering coefficient of a scale-free random graph

DOI10.1016/J.DAM.2011.02.003zbMath1218.05175arXiv0804.3032OpenAlexW1990337750WikidataQ56828217 ScholiaQ56828217MaRDI QIDQ548267

Nicole Eggemann, Steven D. Noble

Publication date: 28 June 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

clustering coefficientscale-free graphBarabási-Albert graph

Mathematics Subject Classification ID

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

Related Items (10)

Towards a Systematic Evaluation of Generative Network Models ⋮ Large communities in a scale-free network ⋮ A large-deviations principle for all the components in a sparse inhomogeneous random graph ⋮ DEGREE-BASED GINI INDEX FOR GRAPHS ⋮ Small subgraphs in preferential attachment networks ⋮ General results on preferential attachment and clustering coefficient ⋮ Clustering and the Hyperbolic Geometry of Complex Networks ⋮ Subgraphs in preferential attachment models ⋮ New classes of clustering coefficient locally maximizing graphs ⋮ Clustering in preferential attachment random graphs with edge-step

Cites Work

• Unnamed Item
• Unnamed Item
• Popularity based random graph models leading to a scale-free degree sequence
• The diameter of a scale-free random graph
• The degree sequence of a scale-free random graph process
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• On random trees
• The Maximum Degree of the Barabási–Albert Random Tree
• A general model of web graphs
• Collective dynamics of ‘small-world’ networks

This page was built for publication: The clustering coefficient of a scale-free random graph