The clustering coefficient of a scale-free random graph

DOI10.1016/J.DAM.2011.02.003MaRDI QIDQ548267zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Abstract: We consider a random graph process in which, at each time step, a new vertex is added with m out-neighbours, chosen with probabilities proportional to their degree plus a strictly positive constant. We show that the expectation of the clustering coefficient of the graph process is asymptotically proportional to log n/n. Bollob'as and Riordan have previously shown that when the constant is zero, the same expectation is asymptotically proportional to ((log n)^2)/n.

Recommendations

• The degree sequence of a scale-free random graph process
• Global Clustering Coefficient in Scale-Free Networks
• Degree and clustering coefficient in sparse random intersection graphs
• A new class of scale free random graphs
• Clustering coefficient of a preferred attachment affiliation network

Cites work

• scientific article; zbMATH DE number 3777853 (Why is no real title available?)
• scientific article; zbMATH DE number 1246230 (Why is no real title available?)
• A general model of web graphs
• Collective dynamics of `small-world' networks
• Emergence of Scaling in Random Networks
• On random trees
• Popularity based random graph models leading to a scale-free degree sequence
• Statistical mechanics of complex networks
• The Maximum Degree of the Barabási–Albert Random Tree
• The degree sequence of a scale-free random graph process
• The diameter of a scale-free random graph

Cited in

(24)

• DEGREE-BASED GINI INDEX FOR GRAPHS
• Subgraphs in preferential attachment models
• Disparity of clustering coefficients in the Holme-Kim network model
• Approximating Clustering Coefficient and Transitivity
• A large-deviations principle for all the components in a sparse inhomogeneous random graph
• Clustering and the hyperbolic geometry of complex networks
• Clustering coefficients of large networks
• Global clustering coefficient in scale-free weighted and unweighted networks
• New classes of clustering coefficient locally maximizing graphs
• Statistical Clustering of a Random Network by Extremal Properties
• Clustering and cliques in preferential attachment random graphs with edge insertion
• Central limit theorem for the average closure coefficient
• A random graph of moderate density
• Clustering in random line graphs
• Global Clustering Coefficient in Scale-Free Networks
• Towards a Systematic Evaluation of Generative Network Models
• Graphs that locally maximize clustering coefficient in the space of graphs with a fixed degree sequence
• Clustering Coefficients of Random Intersection Graphs
• Clustering in preferential attachment random graphs with edge-step
• Computing the clustering coefficient of a random model of graphs
• General results on preferential attachment and clustering coefficient
• Small subgraphs in preferential attachment networks
• Large communities in a scale-free network
• Closure coefficients in scale-free complex networks

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

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