Connectivity distribution and attack tolerance of general networks with both preferential and random attachments

Physics Letters, Section A: General, Atomic and Solid State Physics

Volumn 303, Issue 5-6, 2002, Pages 337-344

  Liu, Zonghua ^a   Lai, Ying Cheng ^a,b   Ye, Nong ^c   Dasgupta, Partha ^c  

^a Center for Systems Science and Engineering Research   (United States)

^b ARIZONA STATE UNIVERSITY   (United States)

^c NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ATTACK TOLERANCES; CONNECTIVITY DISTRIBUTION; GENERAL NETWORKS; INTENTIONAL ATTACKS; NUMERICAL COMPUTATIONS; PHYSICAL PARAMETERS; PREFERENTIAL AND RANDOM ATTACHMENT; RANDOM FAILURES;

ARTICLE; ELECTRICITY; MATHEMATICAL COMPUTING; PROBABILITY;

EID: 0037190752     PISSN: 03759601     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0375-9601(02)01317-8     Document Type: Article

References (33)

1. A.-L. Barabási, R. Albert, Science 286 (1999) 509.
2. D.J. Watts, S.H. Strogatz, Nature 393 (1998) 440.
3. R. Albert, A.-L. Barabási, Rev. Mod. Phys. 74 (2002) 47.
4. A.-L. Barabási, R. Albert, H. Jeong, Physica A 272 (1999) 173; A.-L. Barabási, R. Albert, H. Jeong, Physica A 281 (2000) 69.
5. A.-L. Barabási, R. Albert, H. Jeong, Physica A 272 (1999) 173; A.-L. Barabási, R. Albert, H. Jeong, Physica A 281 (2000) 69.
6. S. Milgram, Psychol. Today 1 (1967) 60.
7. P. Erdös, A. Rényi, Publ. Math. Inst. Hung. Acad. Sci. 5 (1960) 17; B. Bollobaás, Random Graphs, Academic, London, 1985.
8. P. Erdös, A. Rényi, Publ. Math. Inst. Hung. Acad. Sci. 5 (1960) 17; B. Bollobaás, Random Graphs, Academic, London, 1985.
9. M.E.J. Newman, Phys. Rev. E 64 (2001) 016132.
10. P.L. Krapivsky, S. Redner, F. Leyvraz, Phys. Rev. Lett. 85 (2000) 4629; Z. Liu, Y.-C. Lai, N. Ye, Phys. Rev. E 66 (2002) 036112.
11. P.L. Krapivsky, S. Redner, F. Leyvraz, Phys. Rev. Lett. 85 (2000) 4629; Z. Liu, Y.-C. Lai, N. Ye, Phys. Rev. E 66 (2002) 036112.
12. S.N. Dorogovtsev, J.F.F. Mendes, A.N. Samukhin, Phys. Rev. Lett. 85 (2000) 4633; S.N. Dorogovtsev, J.F.F. Mendes, A.N. Samukhin, cond-mat/0009090; S.N. Dorogovtsev, J.F.F. Mendes, A.N. Samukhin, cond-mat/0011077.
13. S.N. Dorogovtsev, J.F.F. Mendes, A.N. Samukhin, Phys. Rev. Lett. 85 (2000) 4633; S.N. Dorogovtsev, J.F.F. Mendes, A.N. Samukhin, cond-mat/0009090; S.N. Dorogovtsev, J.F.F. Mendes, A.N. Samukhin, cond-mat/0011077.
14. S.N. Dorogovtsev, J.F.F. Mendes, A.N. Samukhin, Phys. Rev. Lett. 85 (2000) 4633; S.N. Dorogovtsev, J.F.F. Mendes, A.N. Samukhin, cond-mat/0009090; S.N. Dorogovtsev, J.F.F. Mendes, A.N. Samukhin, cond-mat/0011077.
15. R. Albert, A.-L. Barabási, Phys. Rev. Lett. 85 (2000) 5234.
16. Some flavors of our general network model have also appeared in the model by Kumar et al., to explain the power-law scaling behavior of the World Wide Web. In their model, as a new node is added to the network, a prototype node is chosen randomly from the already existing nodes. With probability p, the ith edge of the new node is connected randomly to some node in the network, and with probability (1 - p) the edge is connected to the prototype node. A strictly power-law scaling behavior is obtained for the number of incoming links this way, with the exponent given by (2 - p)/ (1 - p). See, R. Kumar, P. Raghavan, S. Rajalopagan, D. Sivakumar, A.S. Tomkins, E. Upfal, in: Proceedings of the 19th Symposium on Principles of Database Systems, p. 1; Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (IEEE Computing Soc.), p. 57.
17. Some flavors of our general network model have also appeared in the model by Kumar et al., to explain the power-law scaling behavior of the World Wide Web. In their model, as a new node is added to the network, a prototype node is chosen randomly from the already existing nodes. With probability p, the ith edge of the new node is connected randomly to some node in the network, and with probability (1 - p) the edge is connected to the prototype node. A strictly power-law scaling behavior is obtained for the number of incoming links this way, with the exponent given by (2 - p)/ (1 - p). See, R. Kumar, P. Raghavan, S. Rajalopagan, D. Sivakumar, A.S. Tomkins, E. Upfal, in: Proceedings of the 19th Symposium on Principles of Database Systems, p. 1; Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (IEEE Computing Soc.), p. 57.
18. A. Vázquez, cond-mat/006132; A. Vázquez, cond-mat/0105031.
19. A. Vázquez, cond-mat/006132; A. Vázquez, cond-mat/0105031.
20. S.N. Dorogovtsev, J.F.F. Mendes, Phys. Rev. E 63 (2001) 025101; S.N. Dorogovtsev, J.F.F. Mendes, Phys. Rev. E 63 (2001) 056125.
21. S.N. Dorogovtsev, J.F.F. Mendes, Phys. Rev. E 63 (2001) 025101; S.N. Dorogovtsev, J.F.F. Mendes, Phys. Rev. E 63 (2001) 056125.
22. A.-L. Barabási, H. Jeong, E. Ravasz, Z. Néda, A. Schubert, T. Vicsek, cond-mat/0104162.
23. G. Bianconi, A.-L. Barabási, Europhys. Lett. 54 (2001) 436; G. Bianconi, A.-L. Barabási, Phys. Rev. Lett. 86 (2001) 5632.
24. G. Bianconi, A.-L. Barabási, Europhys. Lett. 54 (2001) 436; G. Bianconi, A.-L. Barabási, Phys. Rev. Lett. 86 (2001) 5632.
25. G. Ergün, G.J. Rodgers, cond-mat/0103423.
26. P.L. Krapivsky, S. Redner, Phys. Rev. E 63 (2001) 066123.
27. P.L. Krapivsky, G.J. Rodgers, S. Redner, Phys. Rev. Lett. 86 (2001) 5401.
28. B. Tadić, Physica A 293 (2001) 273; B. Tadić, cond-mat/0104029.
29. B. Tadić, Physica A 293 (2001) 273; B. Tadić, cond-mat/0104029.
30. B.A. Huberman, L.A. Adamic, Nature 401 (1999) 131; K.-I. Goh, B. Kahng, D. Kim, Phys. Rev. Lett. 88 (2002) 108701.
31. B.A. Huberman, L.A. Adamic, Nature 401 (1999) 131; K.-I. Goh, B. Kahng, D. Kim, Phys. Rev. Lett. 88 (2002) 108701.
32. R. Albert, H. Jeong, A.-L. Barabási, Nature 406 (2000) 378.
33. R. Albert, H. Jeong, A.-L. Barabási, Nature 401 (1999) 130.