Scale-free behavior of networks with the copresence of preferential and uniform attachment rules

Abstract Complex networks in different areas exhibit degree distributions with a heavy upper tail. A preferential attachment mechanism in a growth process produces a graph with this feature. We herein investigate a variant of the simple preferential attachment model, whose modifications are interesting for two main reasons: to analyze more realistic models and to study the robustness of the scale-free behavior of the degree distribution. We introduce and study a model which takes into account two different attachment rules: a preferential attachment mechanism (with probability 1 − p ) that stresses the rich get richer system, and a uniform choice (with probability p ) for the most recent nodes, i.e. the nodes belonging to a window of size w to the left of the last born node. The latter highlights a trend to select one of the last added nodes when no information is available. The recent nodes can be either a given fixed number or a proportion ( α n ) of the total number of existing nodes. In the first case, we prove that this model exhibits an asymptotically power-law degree distribution. The same result is then illustrated through simulations in the second case. When the window of recent nodes has a constant size, we herein prove that the presence of the uniform rule delays the starting time from which the asymptotic regime starts to hold. The mean number of nodes of degree k and the asymptotic degree distribution are also determined analytically. Finally, a sensitivity analysis on the parameters of the model is performed.

[1]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[2]  Liudmila Ostroumova,et al.  Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient , 2012, WAW.

[3]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

[4]  Christian Borgs,et al.  Degree Distribution of Competition-Induced Preferential Attachment Graphs , 2005, Combinatorics, Probability and Computing.

[5]  M. Small,et al.  Emergence of scaling and assortative mixing through altruism , 2011 .

[6]  Alan M. Frieze,et al.  A general model of web graphs , 2003, Random Struct. Algorithms.

[7]  B. Bollobás.  The evolution of random graphs , 1984 .

[8]  Laura Sacerdote,et al.  Random Graphs Associated to Some Discrete and Continuous Time Preferential Attachment Models , 2015, 1503.06150.

[9]  Ginestra Bianconi,et al.  Competition and multiscaling in evolving networks , 2001 .

[10]  M. Small,et al.  Growing optimal scale-free networks via likelihood. , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

[12]  Derek de Solla Price,et al.  A general theory of bibliometric and other cumulative advantage processes , 1976, J. Am. Soc. Inf. Sci..

[13]  Bálint Tóth,et al.  Random trees and general branching processes , 2007, Random Struct. Algorithms.

[14]  G. Yule,et al.  A Mathematical Theory of Evolution, Based on the Conclusions of Dr. J. C. Willis, F.R.S. , 1925 .

[15]  Irene A. Stegun,et al.  Handbook of Mathematical Functions. , 1966 .

[16]  Gerard Hooghiemstra,et al.  A preferential attachment model with random initial degrees , 2007, 0705.4151.

[17]  G. Yule,et al.  A Mathematical Theory of Evolution Based on the Conclusions of Dr. J. C. Willis, F.R.S. , 1925 .

[18]  Laura Sacerdote,et al.  The role of detachment of in-links in scale-free networks , 2013, ArXiv.

[19]  Mihyun Kang,et al.  The Phase Transition in Multitype Binomial Random Graphs , 2015, SIAM J. Discret. Math..

[20]  Codina Cotar,et al.  On a Preferential Attachment and Generalized Pólya's Urn Model , 2012, 1203.5758.

[21]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.

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

[23]  D J PRICE,et al.  NETWORKS OF SCIENTIFIC PAPERS. , 1965, Science.

[24]  Paul Erdös,et al.  On random graphs, I , 1959 .

[25]  Mihyun Kang,et al.  The phase transition in the multi-type binomial random graph $G(\mathbf{n},P)$ , 2014, 1407.6248.

[26]  Béla Bollobás,et al.  A Simple Branching Process Approach to the Phase Transition in Gn, p , 2012, Electron. J. Comb..

[27]  Svante Janson,et al.  On Symmetry of Uniform and Preferential Attachment Graphs , 2014, Electron. J. Comb..

[28]  Laura Sacerdote,et al.  Generalized Nonlinear Yule Models , 2016, Journal of Statistical Physics.