Attack Robustness and Centrality of Complex Networks

PLoS ONE

Volumn 8, Issue 4, 2013, Pages

  Iyer, Swami ^a   Killingback, Timothy ^a   Sundaram, Bala ^a   Wang, Zhen ^a  

^a UNIVERSITY OF MASSACHUSETTS BOSTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; CLUSTER ANALYSIS; COMPLEX NETWORK SYSTEM; INFORMATION PROCESSING; MATHEMATICAL COMPUTING; MATHEMATICAL MODEL; NERVE CELL NETWORK; PROTEIN PROTEIN INTERACTION; SOCIAL NETWORK;

ALGORITHMS; COMPUTER SIMULATION; MODELS, BIOLOGICAL; MODELS, THEORETICAL;

EID: 84875685487     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0059613     Document Type: Article

References (38)

1. Watts D, Strogatz S, (1998) Collective dynamics of 'small-world' networks. Nature 393: 440-442.
2. Barabási A, Albert R, (1999) Emergence of scaling in random networks. Science 286: 509-512.
3. Strogatz S, (2001) Exploring complex networks. Nature 410: 268-276.
4. Albert R, Barabási A, (2002) Statistical mechanics of complex networks. Reviews of modern physics 74: 47.
5. Newman M, (2003) The structure and function of complex networks. SIAM review 45: 167-256.
6. Newman M (2010) Networks: An Introduction. Oxford University Press.
7. Albert R, Jeong H, Barabási A, (2000) Error and attack tolerance of complex networks. Nature 406: 378-382.
8. Callaway D, Newman M, Strogatz S, Watts D, (2000) Network Robustness and Fragility: Percolation on Random Graphs. Physical Review Letters 85: 5468-5471.
9. Cohen R, Erez K, Ben-Avraham D, Havlin S, (2000) Resilience of the Internet to random breakdowns. Physical Review Letters 85: 4626-4628.
10. Cohen R, Havlin S, Ben-Avraham D, (2003) Efficient immunization strategies for computer networks and populations. Physical Review Letters 91: 247901.
11. Crucitti P, Latora V, Marchiori M, Rapisarda A, (2003) Efficiency of scale-free networks: error and attack tolerance. Physica A: Statistical Mechanics and its Applications 320: 622-642.
12. Peixoto T, Bornholdt S, (2012) Evolution of robust network topologies: Emergence of central backbones. Physical Review Letters 109: 118703.
13. Schneider C, Moreira A, Andrade Jr J, Havlin S, Herrmann H, (2011) Mitigation of malicious attacks on networks. Proceedings of the National Academy of Sciences 108: 3838-3841.
14. Holme P, Kim B, Yoon C, Han S, (2002) Attack vulnerability of complex networks. Physical Review E 65: 056109.
15. Crucitti P, Latora V, Marchiori M, Rapisarda A, (2004) Error and attack tolerance of complex networks. Physica A: Statistical Mechanics and its Applications 340: 388-394.
16. Allesina S, Pascual M, (2009) Googling food webs: can an eigenvector measure species' importance for coextinctions? PLoS computational biology 5: e1000494.
17. Salathé M, Kazandjieva M, Lee J, Levis P, Feldman M, et al. (2010) A high-resolution human contact network for infectious disease transmission. Proceedings of the National Academy of Sciences 107: 22020-22025.
18. Stauffer D, Aharony A (1994) Introduction To Percolation Theory. Taylor & Francis.
19. Wasserman S, Faust K (2000) Social Network Analysis: A Handbook. Sage.
20. Wasserman S, Faust K (1994) Social Network Analysis: Methods and Applications, volume 8. Cambridge University Press.
21. Bonacich P, (1987) Power and centrality: A family of measures. American journal of sociology 92: 1170-1182.
22. Newman M (2008) Mathematics of networks. The New Palgrave Encyclopedia of Economics.
23. Dym H (2007) Linear algebra in action, volume 78. American Mathematical Society.
24. Freeman L, (1979) Centrality in social networks: conceptual clarification. Social networks 1: 215-239.
25. Beauchamp M, (1965) An improved index of centrality. Behavioral Science 10: 161-163.
26. Fredman M, Tarjan R, (1987) Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM (JACM) 34: 596-615.
27. Freeman L, (1977) A set of measures of centrality based on betweenness. Sociometry 40: 35-41.
28. Brandes U, (2001) A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25: 163-177.
29. Callaway D, Hopcroft J, Kleinberg J, Newman M, Strogatz S, (2001) Are randomly grown graphs really random? Physical Review E 64: 041902.
30. Amaral L, Scala A, Barthélémy M, Stanley H, (2000) Classes of small-world networks. Proceedings of the National Academy of Sciences 97: 11149.
31. Holme P, Kim B, (2002) Growing scale-free networks with tunable clustering. Physical Review E 65: 026107.
32. Newman M, (2002) Assortative mixing in networks. Physical Review Letters 89: 208701.
33. Xulvi-Brunet R, Sokolov I, (2004) Reshuffling scale-free networks: From random to assortative. Physical Review E 70: 066102.
34. White J, Southgate E, Thomson J, Brenner S, (1986) The structure of the nervous system of the nematode Caenorhabditis elegans. Philosophical Transactions of the Royal Society of London B, Biological Sciences 314: 1-340.
35. Jeong H, Mason S, Barabasi AL, Oltvai Z, (2001) Lethality and centrality in protein networks. Nature 411: 41-42.
36. Lusseau D, Schneider K, Boisseau O, Haase P, Slooten E, et al. (2003) The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behavioral Ecology and Sociobiology 54: 396-405.
37. Newman M, (2001) The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences 98: 404-409.
38. Newman M, (2006) Finding community structure in networks using the eigenvectors of matrices. Physical Review E 74: 036104.