Analytic Solution to Clustering Coefficients on Weighted Networks

Abstract

Clustering coefficient is an important topological feature of complex networks. It is, however, an open question to give out its analytic expression on weighted networks yet. Here we applied an extended mean-field approach to investigate clustering coefficients in the typical weighted networks proposed by Barrat, Barthélemy and Vespignani (BBV networks). We provide analytical solutions of this model and find that the local clustering in BBV networks depends on the node degree and strength. Our analysis is well in agreement with results of numerical simulations.

A paper with 9 pages, 3 figures

References in corpus (6)

• Random graphs with clustering
• The effects of spatial constraints on the evolution of weighted complex networks
• How to make a fragile network robust and vice versa
• Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
• Effects of accelerating growth on the evolution of weighted complex networks
• Recursive weighted treelike networks