Weight-driven growing networks

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 71, Issue 2, 2005, Pages

  Antal, T ^a,b   Krapivsy, P L ^a  

^a Boston University   (United States)

^b EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDED PROBES; MICRORHEOLOGY; QUASIELASTIC LIGHT SCATTERING (QELS); VIDEO-BASED PARTICLE TRACKING;

ACRYLICS; CROSSLINKING; LIGHT SCATTERING; PARTICLE SIZE ANALYSIS; POLYAMIDES; PROBES; RHEOLOGY; SURFACE CHEMISTRY; THERMAL DIFFUSION; THERMAL EFFECTS; VISCOELASTICITY;

INTERPENETRATING POLYMER NETWORKS;

ADAPTATION; ANIMAL; BIOLOGICAL MODEL; CELL FUNCTION; CELL PROLIFERATION; COMPUTER SIMULATION; EVALUATION STUDY; GROWTH, DEVELOPMENT AND AGING; HUMAN; NERVE CELL NETWORK; NERVE CELL PLASTICITY; PHYSIOLOGY; POPULATION GROWTH; SIGNAL TRANSDUCTION; STATISTICAL MODEL;

ADAPTATION, PHYSIOLOGICAL; ANIMALS; CELL PHYSIOLOGICAL PHENOMENA; CELL PROLIFERATION; COMPUTER SIMULATION; HUMANS; MODELS, BIOLOGICAL; MODELS, STATISTICAL; NERVE NET; NEURONAL PLASTICITY; POPULATION GROWTH; SIGNAL TRANSDUCTION;

EID: 41349123041     PISSN: 15393755     EISSN: 15502376     Source Type: Journal    
DOI: 10.1103/PhysRevE.71.026103     Document Type: Article

References (33)

1. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of Networks: From Biological Nets to the Internet and WWW (Oxford University Press, Oxford, 2003); R. Pastor-Satorras and A. Vespignani, Evolution and Structure of the Internet: A Statistical Physics Approach (Cambridge University Press, Cambridge, 2004).
2. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of Networks: From Biological Nets to the Internet and WWW (Oxford University Press, Oxford, 2003); R. Pastor-Satorras and A. Vespignani, Evolution and Structure of the Internet: A Statistical Physics Approach (Cambridge University Press, Cambridge, 2004).
3. P. Erdös and P. Rényi, Publ. Math. Inst. Hung. Acad. Sci. 5, 17 (1960).
4. B. Bollobás, Random Graphs (Academic, London, 1985).
5. R. Albert and A.-L. Barabási, Rev. Mod. Phys. 74, 47 (2002).
6. P. L. Krapivsky and S. Redner, Comput. Netw. 39, 277 (2002).
7. M. E. J. Newman, SIAM Rev. 45, 167 (2003).
8. M. E. J. Newman, Phys. Rev. E 64, 016131 (2001); 64, 016132 (2001).
9. M. E. J. Newman, Phys. Rev. E 64, 016131 (2001); 64, 016132 (2001).
10. A.-L. Barabási, H. Jeong, Z. Neda, E. Ravasz, A. Schubert, and T. Vicsek, Physica A 311, 590 (2002).
11. R. Guimera, M. Sales-Pardo, and L. A. N. Amaral, e-print cond-mat/0312535.
12. A. Barrat, M. Barthélemy, and A. Vespignani, Proc. Natl. Acad. Sci. U.S.A. 101, 3747 (2004).
13. L. R. Ford and D. R. Fulkerson, Flows in Networks (Princeton University Press, Princeton, NJ, 1962)
14. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Engle-wood Cliffs, NJ, 1993).
15. P. G. Doyle and J. L. Snell, Random Walks and Electric Networks (Math. Assoc. Amer., Washington, D.C., 1984).
16. L. de Arcangelis, S. Redner, and A. Coniglio, Phys. Rev. B 31, 4725 (1985); 34, 4656 (1986).
17. L. de Arcangelis, S. Redner, and A. Coniglio, Phys. Rev. B 31, 4725 (1985); 34, 4656 (1986).
18. R. Rammal, C. Tannous, P. Breton, and A.-M. S. Tremblay, Phys. Rev. Lett. 54, 1718 (1985).
19. M. E. J. Newman, e-print cond-mat/0407503.
20. E. Almaas, P. L. Krapivsky, and S. Redner, e-print cond-mat/ 0408295.
21. S. H. Yook, H. Jeong, A.-L. Barabási, and Y. Tu, Phys. Rev. Lett. 86, 5835 (2001).
22. J. D. Nob. and H. Rieger, Phys. Rev. E 66, 066127 (2002).
23. D. Zheng, S. Trimper, B. Zheng, and P. M. Hui, Phys. Rev. E 67, 040102(R) (2003).
24. P. J. Macdonald, E. Almaas, and A.-L. Barabási, e-print condmat/0405688.
25. A. Barrat, M. Barthélémy, and A. Vespignani, Phys. Rev. Lett. 92, 228701 (2004); Phys. Rev. E 70, 066149 (2004).
26. A. Barrat, M. Barthélémy, and A. Vespignani, Phys. Rev. Lett. 92, 228701 (2004); Phys. Rev. E 70, 066149 (2004).
27. Negative weights are occasionally appropriate, e.g., they can represent animosity between individuals in a social network.
28. (k-1)(w) via F(w), F(w -1),⋯, F(w-k+1). Since F(w) is continuous but not differentiable at w=1, the cumulative distribution is continuously differentiable k-1 times at w=k (implying that the weight distribution is continuously differentiable k-2 times).
29. w(N) as the average values of the corresponding random variables is asymptotically exact when the weight is sufficiently small; see, e.g., P. L. Krapivsky and S. Redner, J. Phys. A 35, 9517 (2002) for the detailed analysis of these issues in the model where growth is governed by preferential attachment.
30. -3 ln(w).
31. The expected value for the sum of k independent identically distributed random variables taken from the exponential distribution is w=k; in the present case, the average weight of the node of large degree is (slightly) higher since the growth is weight-driven.
32. P. L. Krapivsky and S. Redner, Phys. Rev. E 63, 066123 (2001).
33. P. L. Krapivsky, G. J. Rodgers, and S. Redner, Phys. Rev. Lett. 86, 5401 (2001).