Preferential attachment with information filtering—node degree probability distribution properties

A network growth mechanism based on a two-step preferential rule is investigated as a model of network growth in which no global knowledge of the network is required. In the first filtering step a subset of fixed size m of existing nodes is randomly chosen. In the second step the preferential rule of attachment is applied to the chosen subset. The characteristics of thus formed networks are explored using two approaches: computer simulations of network growth and a theoretical description based on a master equation. The results of the two approaches are in excellent agreement. Special emphasis is put on the investigation of the node degree probability distribution. It is found that the tail of the distribution has the exponential form given by exp(-k/m). Implications of the node degree distribution with such tail characteristics are briefly discussed.

[1]  S. Redner,et al.  Organization of growing random networks. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Alessandro Vespignani,et al.  Epidemic dynamics and endemic states in complex networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  S. N. Dorogovtsev,et al.  Exactly solvable small-world network , 1999, cond-mat/9907445.

[4]  V. Latora,et al.  Efficiency of scale-free networks: error and attack tolerance , 2002, cond-mat/0205601.

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

[6]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[7]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[8]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[9]  S. Redner.  How popular is your paper? An empirical study of the citation distribution , 1998, cond-mat/9804163.

[10]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[11]  Stefano Mossa,et al.  Truncation of power law behavior in "scale-free" network models due to information filtering. , 2002, Physical review letters.

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

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

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

[15]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

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

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

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

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

[20]  A. Barabasi,et al.  Bose-Einstein condensation in complex networks. , 2000, Physical review letters.