Properties of a random attachment growing network.

In this study we introduce and analyze the statistical structural properties of a model of growing networks which may be relevant to social networks. At each step a new node is added which selects k possible partners from the existing network and joins them with probability delta by undirected edges. The "activity" of the node ends here; it will get new partners only if it is selected by a newcomer. The model produces an infinite-order phase transition when a giant component appears at a specific value of delta, which depends on k. The average component size is discontinuous at the transition. In contrast, the network behaves significantly different for k=1. There is no giant component formed for any delta and thus in this sense there is no phase transition. However, the average component size diverges for delta> or =1/2.

[1]  J. Montoya,et al.  Small world patterns in food webs. , 2002, Journal of theoretical biology.

[2]  A. Barabasi,et al.  Evolution of the social network of scientific collaborations , 2001, cond-mat/0104162.

[3]  S. N. Dorogovtsev,et al.  Anomalous percolation properties of growing networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[5]  J. Hopcroft,et al.  Are randomly grown graphs really random? , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  S. N. Dorogovtsev,et al.  Scaling properties of scale-free evolving networks: continuous approach. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Ricard V. Solé,et al.  Complexity and fragility in ecological networks , 2000, Proceedings of the Royal Society of London. Series B: Biological Sciences.

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

[9]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[10]  A. Barbour,et al.  Small worlds , 2000, Random Struct. Algorithms.

[11]  S. N. Dorogovtsev,et al.  Evolution of networks with aging of sites , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[12]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

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

[14]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[15]  A. Barabasi,et al.  Mean-field theory for scale-free random networks , 1999, cond-mat/9907068.

[16]  Amos Maritan,et al.  Size and form in efficient transportation networks , 1999, Nature.

[17]  M. Marchesi,et al.  Scaling and criticality in a stochastic multi-agent model of a financial market , 1999, Nature.

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

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

[20]  Vaclav Smil,et al.  Book of numbers , 1996, Nature.

[21]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[22]  John Scott.  Social Network Analysis , 1988 .

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

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

[25]  S. Kauffman.  Metabolic stability and epigenesis in randomly constructed genetic nets. , 1969, Journal of theoretical biology.

[26]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[27]  M. V. Valkenburg.  Network Analysis , 1964 .