Vulnerability of robust preferential attachment networks

Electronic Journal of Probability

Volumn 19, Issue , 2014, Pages

  Eckhoff, Maren ^a   Mörters, Peter ^a  

^a UNIVERSITY OF BATH   (United Kingdom)

Author keywords

Barab si albert model; Diameter; Killed branching random walk; Maximal degree; Multitype branching process; Network distance; Percolation; Power law; Preferential attachment; Robustness; Scale free network; Small world; Vulnerability

Indexed keywords

EID: 84903886541     PISSN: None     EISSN: 10836489     Source Type: Journal    
DOI: 10.1214/EJP.v19-2974     Document Type: Article

References (32)

1. Réka Albert, István Albert, and Gary L. Nakarado, Structural vulnerability of the North American power grid, Phys. Rev. E 69 (2004), 025103.
2. Réka Albert, Hawoong Jeong, and Albert-László Barabási, Error and attack tolerance of complex networks, Nature 406 (2000), 378-382.
3. Albert-László Barabási and Réka Albert, Emergence of Scaling in Random Networks, Science 286 (1999), no. 5439, 509-512. MR-2091634
4. Shankar Bhamidi, Remco van der Hofstad, and Gerard Hooghiemstra, Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks, Adv. Appl. Probab. 42 (2010), no. 3, 706-738. MR-2779556
5. John D. Biggins and Andreas E. Kyprianou, Measure change in multitype branching, Adv. Appl. Probab. 36 (2004), no. 2, 544-581. MR-2058149
6. Béla Bollobás, Svante Janson, and Oliver Riordan, The Phase Transition in Inhomogeneous Random Graphs, Random Structures Algorithms 31 (2007), no. 1, 3-122. MR-2337396
7. Béla Bollobás and Oliver Riordan, Robustness and Vulnerability of Scale-Free Random Graphs, Internet Math. 1 (2003), no. 1, 1-35. MR-2076725
8. Duncan S. Callaway, Mark E. J. Newman, Steven H. Strogatz, and Duncan J. Watts, Network Robustness and Fragility: Percolation on Random Graphs, Phys. Rev. Lett. 85 (2000), no. 25, 5468-5471.
9. Fan Chung and Linyuan Lu, The average distances in random graphs with given expected degrees, Proc. Nat. Acad. Sci. USA 99 (2002), no. 25, 15879-15882. MR-1944974
10. Fan Chung and Linyuan Lu, Complex graphs and networks, Regional Conference Series in Mathematics, vol. 107, Co-publication of the AMS and CBMS, 2006.
11. Reuven Cohen, Keren Erez, Daniel ben-Avraham, and Shlomo Havlin, Breakdown of the Internet under Intentional Attack, Phys. Rev. Lett. 86 (2001), 3682-3685.
12. Reuven Cohen, Keren Erez, Daniel ben-Avraham, and Shlomo Havlin, Reply, Phys. Rev. Lett. 87 (2001), 219802.
13. Steffen Dereich, Christian Mönch, and Peter Mörters, Typical distances in ultrasmall random networks, Adv. Appl. Probab. 44 (2012), 583-601. MR-2977409
14. Steffen Dereich and Peter Mörters, Random networks with sublinear preferential attachment: degree evolutions, Electron. J. Probab. 14 (2009), 1222-1267. MR-2511283
15. Steffen Dereich and Peter Mörters, Random networks with sublinear preferential attachment: the giant component, Ann. Probab. 41 (2013), no. 1, 329-384. MR-3059201
16. Sander Dommers, Remco van der Hofstad, and Gerard Hooghiemstra, Diameters in preferential attachment models, J. Stat. Phys. 139 (2010), no. 1, 72-107. MR-2602984
17. Sergey N. Dorogovtsev and José F. F. Mendes, Comment on "Breakdown of the Internet under Intentional Attack", Phys. Rev. Lett. 87 (2001), 219801.
18. Henri van den Esker, Remco van der Hofstad, Gerard Hooghiemstra, and Dmitri Znamenski, Distances in random graphs with infinite mean degrees, Extremes 8 (2006), no. 3, 111-141. MR-2275914
19. William Feller, An introduction to probability theory and its applications, vol. II, Wiley, New York, 1971. MR-0270403
20. Simon C. Harris, Marion Hesse, and Andreas E. Kyprianou, Branching Brownian motion in a strip: survival near criticality, Preprint arXiv: arXiv: 1212.1444, 2012.
21. Theodore E. Harris, The theory of branching processes, Grundlehren Math. Wiss., Springer, Berlin, 1963. MR-0163361
22. Harro Heuser, Functional analysis, Wiley, Chichester, 1982. MR-0640429
23. Remco van der Hofstad, Random graphs and complex networks, Draft book, available online at http: //www.win.tue.nl/_rhofstad/NotesRGCN.html, 2013.
24. Petter Holme, Beom Jun Kim, Chang No Yoon, and Seung Kee Han, Attack vulnerability of complex networks, Phys. Rev. E 65 (2002), 056109.
25. Svante Janson, On percolation in random graphs with given vertex degrees, Electron. J. Probab. 14 (2009), no. 5, 87-118. MR-2471661
26. Svante Janson and Malwina J. Luczak, A New Approach to the Giant Component Problem, Random Structures Algorithms 34 (2008), no. 2, 197-216. MR-2490288
27. Tosio Kato, Perturbation Theory for Linear Operators, Classics Math., Springer, Berlin, 1995, Reprint of the 1980 edition. MR-1335452
28. Peter D. Miller, Applied asymptotic analysis, Graduate Studies in Mathematics, vol. 75, Amer. Math. Soc., 2006. MR-2238098
29. Igor Mishkovski, Mario Biey, and Ljupco Kocarev, Vulnerability of complex networks, Commun. Nonlinear Sci. Numer. Simul. 16 (2011), no. 1, 341-349. MR-2679185
30. Michael Molloy and Bruce Reed, A critical point for random graphs with a given degree sequence, Random Structures Algorithms 6 (1995), no. 2-3, 161-180. MR-1370952
31. Christian Mönch, Distances in preferential attachment networks, Ph.D. thesis, University of Bath, 2013.
32. Ross G. Pinsky, Positive Harmonic Functions and Diffusion, Cambridge Stud. Adv. Math, vol. 45, Cambridge University Press, Cambridge, 1995. MR-1326606