Higher order clustering coefficients in Barabasi-Albert networks
arXiv:cond-mat/0212237 · doi:10.1016/S0378-4371(02)01336-5
Abstract
Higher order clustering coefficients are introduced for random networks. The coefficients express probabilities that the shortest distance between any two nearest neighbours of a certain vertex equals , when one neglects all paths crossing the node . Using we found that in the Barabási-Albert (BA) model the average shortest path length in a node's neighbourhood is smaller than the equivalent quantity of the whole network and the remainder depends only on the network parameter . Our results show that small values of the standard clustering coefficient in large BA networks are due to random character of the nearest neighbourhood of vertices in such networks.
10 pages, 4 figures
References in corpus (10)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The diameter of the world wide web
- Evolution of networks
- Who is the best connected scientist? A study of scientific coauthorship networks
- Mean-field theory for scale-free random networks
- Clustering and preferential attachment in growing networks
- Growing Scale-Free Networks with Tunable Clustering
- Deterministic Scale-Free Networks
- Ferromagnetic Phase Transition in Barabasi-Albert Networks
Cited by in corpus (14)
- The structure and function of complex networks
- Complex Networks as Hypergraphs
- Higher-order clustering in networks
- Mean-field theory for clustering coefficients in Barabasi-Albert networks
- Cyclic Topology in Complex Networks
- Neighborhood properties of complex networks
- A Network Science perspective of Graph Convolutional Networks: A survey
- Random graphs with arbitrary clustering and their applications
- Supremacy distribution in evolving networks
- Network clustering and community detection using modulus of families of loops
- Nonlinear Barabási-Albert Network
- Percolation in random graphs with higher-order clustering
- Stratified communities in complex business networks
- Cliques and a new measure of clustering: with application to U.S. domestic airlines