Classification of scale-free networks
Author(s) -
K.-I. Goh,
Eunsoon Oh,
Hawoong Jeong,
B. Kahng,
Doochul Kim
Publication year - 2002
Publication title -
proceedings of the national academy of sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 5.011
H-Index - 771
eISSN - 1091-6490
pISSN - 0027-8424
DOI - 10.1073/pnas.202301299
Subject(s) - betweenness centrality , degree distribution , exponent , scale free network , complex network , preferential attachment , centrality , universality (dynamical systems) , degree (music) , topology (electrical circuits) , hierarchical network model , power law , network motif , computer science , theoretical computer science , mathematics , statistical physics , combinatorics , physics , statistics , linguistics , philosophy , quantum mechanics , acoustics
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 between ness centrality displays a power-law distribution with an exponent eta, which is robust, and use it to classify the scale-free networks. We have observed two universality classes with eta approximately equal 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 coauthorship 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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom