Scalefree 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 scalefree 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 powerlaw 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.
 Publication:

Physica D Nonlinear Phenomena
 Pub Date:
 May 2018
 DOI:
 10.1016/j.physd.2018.01.005
 arXiv:
 arXiv:1704.08597
 Bibcode:
 2018PhyD..371....1P
 Keywords:

 BarabásiAlbert random graph;
 Preferential and uniform attachments;
 Degree distribution;
 Mathematics  Probability;
 05C80;
 90B15;
 60J80
 EPrint:
 doi:10.1016/j.physd.2018.01.005