Classification of scale-free networks

Abstract

While the emergence of a power law degree distribution in complex networks is intriguing, the degree exponent is not universal. Here we show that the betweenness centrality displays a power-law distribution with an exponent ηwhich is robust and use it to classify the scale-free networks. We have observed two universality classes with η\approx 2.2(1) and 2.0, respectively. Real world networks for the former are the protein interaction networks, the metabolic networks for eukaryotes and bacteria, and the co-authorship network, and those for the latter one are the Internet, the world-wide web, and the metabolic networks for archaea. Distinct features of the mass-distance relation, generic topology of geodesics and resilience under attack of the two classes are identified. Various model networks also belong to either of the two classes while their degree exponents are tunable.

6 Pages, 6 Figures, 1 table

References in corpus (8)

• Statistical mechanics of complex networks
• Lethality and centrality in protein networks
• Evolution of networks
• Evolution of the social network of scientific collaborations
• Universal Behavior of Load Distribution in Scale-free Networks
• A Geometric Fractal Growth Model for Scale Free Networks
• Infinite-Order Percolation and Giant Fluctuations in a Protein Interaction Network
• Shortest paths and load scaling in scale-free trees

Cited by in corpus (61)

• The structure and function of complex networks
• Spatial Networks
• Characterization of complex networks: A survey of measurements
• Subgraph Centrality in Complex Networks
• Scale-free networks are rare
• Betweenness Centrality in Large Complex Networks
• Complex networks in climate dynamics - Comparing linear and nonlinear network construction methods
• Statistical properties of sampled networks
• Betweenness centrality correlation in social networks
• Congestion and centrality in traffic flow on complex networks
• Fractality in complex networks: critical and supercritical skeletons
• Assortative model for social networks
• A Survey on Centrality Metrics and Their Implications in Network Resilience
• Recursive graphs with small-world scale-free properties
• True scale-free networks hidden by finite size effects
• Characterizing the network topology of the energy landscapes of atomic clusters
• Optimal Traffic Networks
• Robustness of the avalanche dynamics in data packet transport on scale-free networks
• Extensive load in multitasking associative networks
• Complete Condensation in a Zero Range Process on Scale-Free Networks
• Exact scaling properties of a hierarchical network model
• Reconfigurable optical implementation of quantum complex networks
• Stability of shortest paths in complex networks with random edge weights
• The Social Network of Contemporary Popular Musicians
• Betweenness centrality of teams in social networks
• Mapping and discrimination of networks in the complexity-entropy plane
• Identifying the role that individual animals play in their social network
• Towards realistic artificial benchmark for community detection algorithms evaluation
• Nonlocal evolution of weighted scale-free networks
• Comment on: 'Universal Behavior of Load Distribution in Scale-free Networks'
• Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality"
• Fluctuation-driven capacity distribution in complex networks
• Topologies and Laplacian spectra of a deterministic uniform recursive tree
• Effect of shortest path multiplicity on congestion of multiplex networks
• Is academia becoming more localised? The growth of regional knowledge networks within international research collaboration
• Ising model in clustered scale-free networks
• Reply to "Comment on 'Universal Behavior of Load Distribution in Scale-Free Networks'"
• Collaboration networks from a large CV database: dynamics, topology and bonus impact
• The Fractional Preferential Attachment Scale-Free Network Model
• Probabilistic prediction in scale-free networks: Diameter changes
• Identifying time dependence in network growth
• Scale-Free Networks beyond Power-Law Degree Distribution
• Synchronous and Asynchronous Recursive Random Scale-Free Nets
• Kinetic growth walks on complex networks
• Scaling of load in communications networks
• Antiferromagnetic Ising model in scale-free networks
• Transmission of packets on a hierarchical network: Statistics and explosive percolation
• Social patterns revealed through random matrix theory
• Structural and spectral properties of a family of deterministic recursive trees: Rigorous solutions
• Clarifying How Degree Entropies and Degree-Degree Correlations Relate to Network Robustness
• Self-avoiding walks and connective constants in clustered scale-free networks
• Connectivity Damage to a Graph by the Removal of an Edge or a Vertex
• Ferromagnetic Ising spin systems on the growing random tree
• Morphological organization of point-to-point transport in complex networks
• Canonical fitness model for simple scale-free graphs
• Scatter Networks: A New Approach for Analyzing Information Scatter on the Web
• Inhomogeneous substructures hidden in random networks
• Fluctuation-induced traffic congestion in heterogeneous networks
• Providing a Link Prediction Model based on Structural and Homophily Similarity in Social Networks
• On the centroid of increasing trees
• Random Walks on Complex Networks