Resilience of public transport networks against attacks

European Physical Journal B

Volumn 71, Issue 1, 2009, Pages 125-137

  Berche, B ^a,d   Von Ferber, C ^b,c   Holovatch, T ^a,b   Holovatch, Yu ^a,d,e  

^a INSTITUT JEAN LAMOUR   (France)

^b Faculty of Engineering and Computing   (United Kingdom)

^c UNIVERSITY OF FREIBURG   (Germany)

^d INSTITUTE FOR CONDENSED MATTER PHYSICS   (Ukraine)

^e JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

02.50. r Probability theory, stochastic processes, and statistics; 07.05.Rm Data presentation and visualization: algorithms and implementation; 89.75.Hc Networks and genealogical trees

Indexed keywords

02.50.-R PROBABILITY THEORY, STOCHASTIC PROCESSES, AND STATISTICS; 07.05.RM DATA PRESENTATION AND VISUALIZATION: ALGORITHMS AND IMPLEMENTATION; 89.75.HC NETWORKS AND GENEALOGICAL TREES; ATTACK STRATEGIES; COMPLEX NETWORKS; HIGH IMPACT; MAJOR CITIES; PUBLIC TRANSPORT NETWORKS; RANDOM FAILURES; SCALE FREE NETWORKS; SCALE-FREE BEHAVIOR;

RANDOM PROCESSES; VISUALIZATION;

DATA VISUALIZATION;

EID: 70349729717     PISSN: 14346028     EISSN: 14346036     Source Type: Journal    
DOI: 10.1140/epjb/e2009-00291-3     Document Type: Article

References (48)

1. R. Albert A.-L. Barabási 2002 Rev. Mod. Phys. 74 47
2. S.N. Dorogovtsev J.F.F. Mendes 2002 Adv. Phys. 51 1079
3. M.E.J. Newman 2003 SIAM Rev. 45 167
4. S.N. Dorogovtsev, S.N. Mendes, Evolution of Networks (Oxford University Press, Oxford, 2003)
5. R. Albert H. Jeong A.-L. Barabási 2000 Nature (London) 406 378
6. Y. Tu 2000 Nature (London) 406 353
7. H. Jeong B. Tombor R. Albert Z.N. Oltvai A.-L. Barabási 2000 Nature (London) 407 651
8. R.V. Solé J.M. Montoya 2001 Proc. R. Soc. Lond. B 268 2039
9. H. Jeong S.P. Mason A.-L. Barabási Z.N. Oltvai 2001 Nature (London) 411 41
10. R. Cohen K. Erez D. ben-Avraham S. Havlin 2000 Phys. Rev. Lett. 85 4626
11. D.S. Callaway M.E.J. Newman S.H. Strogatz D.J. Watts 2000 Phys. Rev. Lett. 85 5468
12. J.W. Essam 1980 Rep. Prog. Phys. 43 833
13. P. Erdös A. Rényi 1959 Publ. Math. (Debrecen) 6 290
14. P. Erdös A. Rényi 1960 Publ. Math. Inst. Hung. Acad. Sci. 5 17
15. P. Erdös A. Rényi 1961 Bull. Inst. Int. Stat. Tokyo 38 343
16. P. Erdös, A. Rényi, B. Bollobás, Random Graphs (Academic Press, London, 1985)
17. M. Molloy B.A. Reed 1995 Random Struct. Algorithms 6 161
18. R. Cohen K. Erez D. ben-Avraham S. Havlin 2001 Phys. Rev. Lett. 86 3682
19. T. Kalisky R. Cohen 2006 Phys. Rev. E 73 035101(R)
20. R. Xulvi-Brunet W. Pietsch I.M. Sokolov 2003 Phys. Rev. E 68 036119
21. P. Holme B.J. Kim C.N. Yoon S.K. Han 2002 Phys. Rev. E 65 056109
22. Note however that an early paper on metabolism networks [6] checked 43 different organisms
23. A.-L. Barabási R. Albert 1999 Science 286 509
24. A.-L. Barabási, R. Albert, H. Jeong, Physica A 272, 173 (1999)
25. A. Broder R. Kumar F. Maghoul P. Raghavan S. Rajagopalan R. Stata A. Tomkins J. Wiener 2000 Comput. Netw. 33 309
26. M. Girvan M.E.J. Newman 2002 Proc. Natl. Acad. Sci. USA 99 7821 1032.91716
27. R. Guimera L.A.N. Amaral 2004 Eur. Phys. J. B 38 381
28. R. Guimera S. Mossa A. Turtschi L.A.N. Amaral 2005 Proc. Nat. Acad. Sci. USA 102 7794 1135.90309
29. C. von Ferber Yu. Holovatch V. Palchykov 2005 Condens. Matter Phys. 8 225
30. C. von Ferber, T. Holovatch, Yu. Holovatch, V. Palchykov, Physica A 380, 585 (2007)
31. C. von Ferber T. Holovatch Yu. Holovatch V. Palchykov 2009 Eur. Phys. Jour. B 68 261, e-print arXiv:0803.3514v1
32. C. von Ferber, T. Holovatch, Yu. Holovatch, in Traffic and Granular Flow' 07, edited by C. Appert-Rolland, F. Chevoir, P. Gondret, S. Lassarre, J.-P. Lebacque, M. Schreckenberg (Springer, 2009), pp. 721-731, e-print arXiv:0709.3206
33. For links see http://www.apta.com The database is described in details in reference [23]
34. M. Marchiori V. Latora 2000 Physica A 285 539
35. V. Latora, M. Marchiori, Phys. Rev. Lett. 87, 198701 (2001).
36. V. Latora, M. Marchiori, Physica A 314, 109 (2002).
37. K.A. Seaton, L.M. Hackett, Physica A 339, 635 (2004).
38. J. Sienkiewicz, J.A. Holyst, Phys. Rev. E 72, 046127 (2005).
39. J. Sienkiewicz, J.A. Holyst, Acta Phys. Polonica B 36, 1771 (2005).
40. P. Angeloudis, D. Fisk, Physica A 367, 553 (2006).
41. P.-P. Zhang, K. Chen, Y. He, T. Zhou, B.-B. Su, Y. Jin, H. Chang, Y.-P. Zhou, L.-C. Sun, B.-H. Wang, D.-R. He, Physica A 360, 599 (2006).
42. X. Xu, J. Hu, F. Liu, L. Liu, Physica A 374, 441 (2007).
43. H. Chang, B.-B. Su, Y.-P. Zhou, D.-R. He, Physica A 383, 687 (2007).
44. P. Sen S. Dasgupta A. Chatterjee P.A. Sreeram G. Mukherjee S.S. Manna 2003 Phys. Rev. E 67 036106
45. U. Brandes 2001 J. Math. Sociology 25 163
46. R. Cohen S. Havlin D. ben-Avraham 2003 Phys. Rev. Lett. 91 247901
47. Another obvious difference between the largest cluster S of a network as considered here and the spanning cluster on a lattice is that below the percolation threshold a spanning cluster is absent while there is always some largest cluster, however its relative size may vanish in the infinite network limit.
48. T. Holovatch, B. Berche, C. von Ferber, e-print arXiv:0908.1050