Global Clustering Coefficient in Scale-Free Networks

DOI10.1007/978-3-319-13123-8_5MaRDI QIDQ2945272zbMATH OpenOpenAlexFDO

Authors Ostroumova Liudmila Prokhorenkova, Egor Samosvat

Publication date 9 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

degree distribution with an infinite variance

Mathematics Subject Classification ID

Vertex degrees (05C07) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)

Abstract: In this paper, we analyze the behavior of the global clustering coefficient in scale free graphs. We are especially interested in the case of degree distribution with an infinite variance, since such degree distribution is usually observed in real-world networks of diverse nature. There are two common definitions of the clustering coefficient of a graph: global clustering and average local clustering. It is widely believed that in real networks both clustering coefficients tend to some positive constant as the networks grow. There are several models for which the average local clustering coefficient tends to a positive constant. On the other hand, there are no models of scale-free networks with an infinite variance of degree distribution and with a constant global clustering. In this paper we prove that if the degree distribution obeys the power law with an infinite variance, then the global clustering coefficient tends to zero with high probability as the size of a graph grows.

Recommendations

• Global clustering coefficient in scale-free weighted and unweighted networks
• The clustering coefficient of a scale-free random graph
• Clustering coefficients of large networks
• The clustering coefficient and the diameter of small-world networks
• Network model with scale-free, high clustering coefficients, and small-world properties
• Scale-free network clustering in hyperbolic and other random graphs
• Closure coefficients in scale-free complex networks
• Complex scale-free networks with tunable power-law exponent and clustering
• Clustering in a hyperbolic model of complex networks

Cited in

(14)

• Clustering coefficients of large networks
• Large communities in a scale-free network
• Closure coefficients in scale-free complex networks
• Limit theorems for assortativity and clustering in null models for scale-free networks
• Clustering coefficient of a preferred attachment affiliation network
• Disparity of clustering coefficients in the Holme-Kim network model
• Small subgraphs in preferential attachment networks
• General results on preferential attachment and clustering coefficient
• The clustering coefficient of a scale-free random graph
• Global clustering coefficient in scale-free weighted and unweighted networks
• Clustering in random line graphs
• Central limit theorem for the average closure coefficient
• Cascades and fluctuations in an economy with an endogenous production network
• When local and global clustering of networks diverge

This page was built for publication: Global Clustering Coefficient in Scale-Free Networks

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