Random removal of edges from scale free graphs

Physica A: Statistical Mechanics and its Applications

Volumn 371, Issue 2, 2006, Pages 870-876

  Martin, S ^a   Carr, R D ^a   Faulon, J L ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Edge removal; Power law; Scale free graphs

Indexed keywords

EDGE DETECTION; STATISTICAL MECHANICS;

EDGE REMOVAL; POWER LAW; SCALE FREE GRAPHS;

GRAPH THEORY;

EID: 33748682519     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2006.04.046     Document Type: Article

References (21)

1. Watts D.J., and Strogatz S.H. Collective dynamics of 'small-world' networks. Nature 393 (1998) 440-442
2. Faloutsos M., Faloutsos P., and Faloutsos C. On power-law relationships of the internet topology. Comput. Commun. Rev. 29 251 (1999)
3. Barabási A.-L., and Albert R. Emergence of scaling in random networks. Science 286 (1999) 509-512
4. Erdo{combining double acute accent}s P., and Rényi A. On random graphs I. Publicationes Mathematicae Debrecen 5 (1959) 290-297
5. Newman M.E.J. The structure and function of complex networks. SIAM Rev. 45 2 (2003) 167-256
6. Albert R., and Barabási A.-L. Statistical mechanics of complex networks. Rev. Mod. Phys. 74 (2001) 47-97
7. Dorogovtsev S.N., and Mendes J.F.F. Evolution of networks. Adv. Phys. 51 1079 (2002)
8. Cooper C., and Frieze A. On a general model of web graphs. Proceedings of ESA, Lecture Notes in Computer Science vol. 2161 (2001), Springer, Berlin 500-511
9. P.G. Buckley, D. Osthus, Popularity based random graph models leading to a scale-free degree sequence. 〈http://www.informatik.hu-berlin.de/∼osthus〉.
10. Bollobás B., Riordan O., Spencer J., and Tusnády G. The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18 (2001) 279-290
11. Aiello W., Chung F., and Lu L. A random graph model for power law graphs. Exp. Math. 10 (2001) 53-66
12. Bollobás B., and Riordan O. Mathematical results on scale-free random graphs. In: Bornholdt S., and Schuster H.G. (Eds). Handbook of Graphs and Networks (2002), Wiley-VCH 1-34
13. Albert R., Jeong H., and Barabási A.-L. Error and attack tolerance of complex networks. Nature 406 (2000) 378-382
14. Callaway D.S., Newman M.E.J., Strogatz S.H., and Watts D.J. Network robustness and fragility: percolation on random graphs. Phys. Rev. Lett. 85 (2000) 5468-5471
15. Cohen R., Erez K., Ben-Avraham D., and Havlin S. Resilience of the internet to random breakdowns. Phys. Rev. Lett. 85 (2000) 4626-4628
16. Bollobás B., and Riordan O. Robustness and vulnerability of scale-free random graphs. Internet Math. 1 1 (2003) 1-35
17. D.P. Chassin, C. Posse, Evaluating North American electric grid reliability using the Barabási-Albert network model, arXiv:nlin/0406052, 2004.
18. Braess D. Uber ein pardoxon aus der verkehrsplanung on a pardox of traffic planning. Unternehmensforschung 12 (1968) 258-268 (Translation from German by D. Braess, A. Nagurney, T. Wakolbinger)
19. Stumpf M.P.H., Wiuf C., and May R.M. Subnets of scale-free networks are not scale-free: sampling properties of networks. Proc. Natl. Acad. Sci. 102 (2005) 4221-4224
20. MapleSoft. Maple V Release 4. 〈http://www.maplesoft.com〉, 2002.
21. The MathWorks. Matlab 6.5. 〈http://www.mathworks.com〉, 2002.