DEGREE SEQUENCES BEYOND POWER LAWS IN COMPLEX NETWORKS
Author(s) -
Zhanying Zhang,
Wenjun Xiao,
Guanrong Chen
Publication year - 2016
Publication title -
journal of applied analysis and computation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.55
H-Index - 21
eISSN - 2158-5644
pISSN - 2156-907X
DOI - 10.11948/2016072
Subject(s) - degree (music) , exponent , vertex (graph theory) , degree distribution , combinatorics , complex network , power law , mathematics , order (exchange) , preferential attachment , discrete mathematics , physics , graph , philosophy , linguistics , acoustics , economics , statistics , finance
Many complex networks possess vertex-degree distributions in a power-law form of ck−γ , where k is the degree variable and c and γ are constants. To better understand the mechanism of power-law formation in realworld networks, it is effective to analyze their degree variable sequences. We had shown before that, for a scale-free network of size N ,if its vertex-degree sequence is k1 < k2 < . . . < kl , where {k1, k2, . . . , kl} is the set of all unequal vertex degrees in the network, and if its power exponent satisfies γ > 1 , then the length l of the vertex-degree sequence is of order logN . In the present paper, we further study complex networks with more general distributions and prove that the same conclusion holds even for non-network type of complex systems. In addition, we support the conclusion by verifying many real-world network and system examples. We finally discuss some potential applications of the new finding in various fields of science, technology and society.
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