Characterizing general scale-free networks by vertex-degree sequences.

Many complex networks possess a scale-free vertex-degree distribution in a power-law form of ck(-γ), where k is the vertex-degree variable and c and γ are constants. To better understand the mechanism of the power-law formation in scale-free networks, it is important to understand and analyze their vertex-degree 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 non-equal vertex degrees in the network, and if its power exponent satisfies γ>1, then the length l of the vertex-degree sequence is of order log N. In the present paper, we further study complex networks with a more general vertex-degree distribution, not restricted to the power-law, and prove that the same conclusion holds as well. In addition, we verify the new result by real data from a large number of real-world examples. We finally discuss some potential applications of the new finding in various fields of science, technology, and society.

[1]  Wenjun Xiao,et al.  Characterizing vertex-degree sequences in scale-free networks ☆ , 2014 .

[2]  Weidong Chen,et al.  On Necessary Conditions for Scale-Freedom in Complex Networks with Applications to Computer Communication Systems , 2008 .

[3]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[4]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[5]  M E Newman,et al.  Scientific collaboration networks. I. Network construction and fundamental results. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Changpin Li,et al.  Topological Properties of Fibonacci Networks , 2013 .

[7]  Ramon Ferrer i Cancho,et al.  The small world of human language , 2001, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[8]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[9]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[10]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[11]  André Raspaud,et al.  Recursive graphs with small-world scale-free properties. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[14]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  S. Bornholdt,et al.  Scale-free topology of e-mail networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Guanrong Chen,et al.  A Small-World Model of Scale-Free Networks: Features and Verifications , 2011 .

[17]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..