Optimization of network robustness to random breakdowns

Physica A: Statistical Mechanics and its Applications

Volumn 370, Issue 2, 2006, Pages 854-862

  Paul, Gerald ^a   Sreenivasan, Sameet ^a   Havlin, Shlomo ^a,b   Eugene Stanley, H ^a  

^a USA   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

Network robustness; Random breakdown

Indexed keywords

HEURISTIC METHODS; OPTIMAL CONTROL SYSTEMS; RANDOM PROCESSES; ROBUSTNESS (CONTROL SYSTEMS); STATISTICAL METHODS;

FRACTION OF NODES; NETWORK ROBUSTNESS; RANDOM BREAKDOWN; SCALE-FREE NETWORKS;

CIRCUIT THEORY;

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

References (20)

1. Albert R., Jeong H., and Barabási A.-L. Nature (London) 406 (2000) 378
2. Paxon V. IEEE/ACM Trans. Networking 5 (1997) 601
3. Cohen R., Erez K., ben-Avraham D., and Havlin S. Phys. Rev. Lett. 85 (2000) 4626
4. Callaway D.S., Newman M.E.J., Strogatz S.H., and Watts D.J. Phys. Rev. Lett. 85 (2000) 5468
5. Cohen R., Erez K., ben-Avraham D., and Havlin S. Phys. Rev. Lett. 86 (2001) 3682
6. Cohen R., ben-Avraham D., and Havlin S. In: Bornholdt S., and Schuster H.G. (Eds). Handbook of Graphs and Networks (2002), Wiley, New York (Chapter 4)
7. Valente A.X.C.N., Sarkar A., and Stone H.A. Phys. Rev. Lett. 92 (2004) 118702
8. Paul G., Tanizawa T., Havlin S., and Stanley H.E. Eur. Phys. J. B 38 (2004) 187 cond-mat/0404331
9. Tanizawa T., Paul G., Cohen R., Havlin S., and Stanley H.E. Phys. Rev. E 71 (2005) 047101 cond-mat/0406567
10. Chung F., and Lu L. Ann. Combinatorics 6 (2002) 125
11. Burda Z., and Krzywicki A. Phys. Rev. E 67 (2003) 046118
12. Boguñá M., Pastor-Satorras R., and Vespignani A. Eur. Phys. J. B 38 (2004) 205
13. Catanzaro M., Boguñá M., and Pastor-Satorras R. Phys. Rev. E 71 (2005) 027103
14. Paul G., Sreenivasan S., and Stanley H.E. Phys. Rev. E 72 (2005) 056130
15. Arfken G. Lagrange Multipliers, Mathematical Methods for Physicists. third ed. (1985), Academic Press, Orlando, FL pp. 945-950
16. Molloy M., and Reed B. Random Struc. Algorithms 6 (1995) 161
17. Newman M.E.J. Phys. Rev. Lett. 89 (2002) 208701
18. The remaining degree of a vertex is defined as the degree of the vertex -1.
19. 5 as we did for random networks.
20. c does not approach 0 faster than 1 / sqrt(N) for any value of λ.