Mean-field theory for clustering coefficients in Barabasi-Albert networks

Abstract

We applied a mean field approach to study clustering coefficients in Barabasi-Albert networks. We found that the local clustering in BA networks depends on the node degree. Analytic results have been compared to extensive numerical simulations finding a very good agreement for nodes with low degrees. Clustering coefficient of a whole network calculated from our approach perfectly fits numerical data.

8 pages, 3 figures

References in corpus (2)

• Number of loops of size h in growing scale-free networks
• Higher order clustering coefficients in Barabasi-Albert networks

Cited by in corpus (20)

• Statistical analysis of 22 public transport networks in Poland
• Complex Networks as Hypergraphs
• Public transport networks: empirical analysis and modeling
• Clustering of correlated networks
• Spectral Analysis and the Dynamic Response of Complex Networks
• Evolving Apollonian Networks with Small-world Scale-free topologies
• Evolving networks by merging cliques
• Temporal network modeling with online and hidden vertices based on the birth and death process
• Features and heterogeneities in growing network models
• Supremacy distribution in evolving networks
• Link-space formalism for network analysis
• Distance-dependent connectivity: Yet Another Approach to the Small World Phenomenon
• Self-Organization and Complex Networks
• Analytic solutions for links and triangles distributions in finite Barabási-Albert networks
• Unimodular lattice triangulations as small-world and scale-free random graphs
• Analytic Solution to Clustering Coefficients on Weighted Networks
• Link-Space and Network Analysis
• Universal and non-universal text statistics: Clustering coefficient for language identification
• Landau Theory of Adaptive Integration in Computational Intelligence
• Reliable Probabilistic Gossip over Large-Scale Random Topologies