Complex networks: Structure, robustness and function

Complex Networks: Structure, Robustness and Function

Volumn , Issue , 2011, Pages 1-238

  Havlin, Shlomo ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84922962285     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511780356     Document Type: Book

References (293)

1. R. Albert and A.-L. Barabasi, Statistical mechanics of complex networks, Reviews of Modern Physics 74 (2002), 47.
2. L. Addario-Berry, N. Broutin, and B. Reed, The diameter of the minimum spanning tree of a complete graph, Proceedings of the Fourth Colloquium on Mathematics and Computer Science, DMTCS, Nancy, France, 2006, pp. 237–248.
3. W. Aiello, F. Chung, and L. Lu, A random graph model for massive graphs, Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000, pp. 171–180. New York: ACM.
4. W. Aiello, F. R. K. Chung, and L. Lu, Random evolution in massive graphs, IEEE Symposium on Foundations of Computer Science, 2001, pp. 510–519. New York: IEEE.
5. R. Albert, H. Jeong, and A.-L. Barabasi, Diameter of the World Wide Web, Nature 401 (1999), 130.
6. R. Albert, H. Jeong, and A.-L. Barabasi, Error and attack tolerance of complex networks, Nature 406 (2000), 378–382.
7. R. Albert, H. Jeong, and A.-L. Barabasi, correction: error and attack tolerance of complex networks, Nature 409 (2001), 542.
8. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman, Search in power law networks, Physical Review E 64 (2001), 046135.
9. R. M. Anderson and R. M. May, Infectious Diseases in Humans: Dynamics and Control, 1992. Oxford: Oxford University Press.
10. T. M. Apostol, Calculus, volume 1: One-Variable Calculus with an Introduction to Linear Algebra, second edition, 1967. Wiley.
11. Y. Artzy-Randrup, S. J. Fleishman, N. Ben-Tal, and L. Stone, Comment on “Network motifs: simple building blocks of complex networks” and “Superfamilies of evolved and designed networks,” Science 305 (2004), 1107.
12. N. Alon and J. H. Spencer, The Probabilistic Method, Wiley-Interscience Series in Discrete Mathematics and Optimization, 2000. New York: Wiley-Interscience.
13. L. A. N. Amaral, A. Scala, M. Barthelemy, and H. E. Stanley, Classes of smallworld networks, Proceedings of the National Academy of Sciences of the USA 97 (2000), 11149–11152.
14. A.-L. Barabàsi R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509–512.
15. A.-L. Barabàsi R. Albert, and H. Jeong, Scale-free characteristics of random networks: the topology of the World Wide Web, Physica A 281 (2000), 69–77.
16. A.-L. Barabàsi, Linked: How Everything is Connected to Everything Else and What it Means for Business, Science, and Everyday Life, 2003. New York: Plume.
17. M. Barthèlemy, Betweenness centrality in large complex networks, European Physical Journal B 38 (2004), 163.
18. R. J. Baxter, Exactly Solved Models in Statistical Mechanics, 1982. London: Academic Press.
19. G. Bianconi and A.-L. Barabàsi, Bose–Einstein condensation in complex networks, Physical Review Letters 86 (2001), 5632–5635.
20. L. A. Braunstein, S. V. Buldyrev, R. Cohen, S. Havlin, and H. E. Stanley, Optimal paths in disordered complex networks, Physical Review Letters 91 (2003), 168701.
21. A. Barrat, M. Barthèlemy, R. Pastor-Satorras, and A. Vespignani, The architecture of complex weighted networks, Proceedings of the National Academy of Sciences of the USA 101 (2004), 3747–3752.
22. A. Barrat, M. Barthè lemy, and A. Vespignani, Dynamical Processes on Complex Networks, 2008. New York: Cambridge University Press.
23. Z. Burda, J.D. Curreira, and A. Krzywicki, Statistical ensemble of scale-free random graphs, Physical Review E 64 (2001), 046118.
24. G. Bonanno, G. Caldarelli, F. Lillo, S. Miccichè,N. Vandewalle, R. N. Mantegna, Networks of equities in financial markets, European Physical Journal B 38 (2004), 363–371.
25. M. Barthelemy and A. Flammini, Optimal traffic networks, Journal of Statistical Mechanics (2006), L07002.
26. A. Bunde and S. Havlin (eds.), Fractals in Science, 1994. Berlin: Springer.
27. A. Bunde and S. Havlin (eds.), Fractals and Disordered Systems, 1996. Berlin: Springer.
28. D. ben-Avraham and S. Havlin,Diffusion and Reactions in Fractals and Disordered Systems 2000. Cambridge: Cambridge University Press.
29. A.-L. Barabàsi, H. Jeong, Z. Neda, E. Ravasz, A. Schubert, and T. Vicsek, On the topology of the scientific collaboration networks, Physica A 311 (2002), 590–614.
30. Z. Burda and A. Krzywicki, Uncorrelated random networks, Physical Review E 67 (2003), 046118.
31. M. Boguǹà and D. Krioukov, Navigating ultrasmall worlds in ultrashort time, Physical Review Letters 102 (2009), 058701.
32. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, Graph structure in the web, Computer Networks 33 (2000), 309.
33. S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang, Complex networks: structure and dynamics, Physics Reports 424 (2006), 175–308.
34. J. B. Bassingthwaighte, L. S. Liebovitch, and B. J. West, Fractal Physiology, 1994. New York: Oxford University. Press.
35. P. S. Bearman, J. Moody, and K. Stovel, Chains of affection: the structure of adolescent romantic and sexual networks, American Journal of Sociology 110 (2004), 44–91.
36. E. Ben-Naim, P.L. Krapivsky, and S.N. Majumdar, Extremal properties of random trees, Physical Review E 64 (2001), 035101(R).
37. A.-L. Barabàsi and Z. N. Oltvai, Network biology: understanding the cell’s functional organization, Nature Reviews in Genetics 5 (2004), 101–113.
38. S. Boccaletti, The Synchronized Dynamics of Complex Systems, Monograph Series on Nonlinear Science and Complexity, volume 6, 2008. Amsterdam: Elsevier.
39. B. Bollobàs, Aprobabilistic proof of an asymptotic formula for the number of labelled regular graphs, European Journal of Combinatorics 1 (1980), 311–316.
40. B. Bollobàs, Random Graphs, 1985. London: Academic Press.
41. A. Berman and R. J. Plemmons, Nonnegative Matrices in the Mathematical Sciences, 1994. Philadelphia, PA; SIAM.
42. M. Boguǹà and R. Pastor-Satorras, Epidemic spreading in correlated complex networks, Physical Review E 66 (2002), 047104.
43. M. Boguǹà and R. Pastor-Satorras, and A. Vespignani, Absence of epidemic threshold in scale-free networks with degree correlations, Physical Review Letters 90 (2003), 028701.
44. B. Bollobàs and O. M. Riordan, Mathematical results on scale free random graphs. in Handbook of Graphs and Networks, S. Bornholdt and H. G. Schuster, eds., 2002. Berlin: Wiley-VCH.
45. B. Bollobàs and O. M. Riordan, Coupling scale-free and classical random graphs, Internet Mathematics 1 (2004), 215–225.
46. D. ben-Avraham, A. F. Rozenfeld, R. Cohen, and S. Havlin, Geographical embedding of scale free networks, Physica A 330 (2003), 107–116.
47. S. Bornholdt and H. G. Schuster (eds.), Handbook of Graphs and Networks, 2002. Berlin: Wiley-VCH.
48. P. Bak, C. Tang, and K. Wiesenfeld, Self-organized criticality – an explanation of 1/f noise, Physical Review Letters 59 (1987), 381–384.
49. L. A. Braunstein, Z. Wu, Y. Chen, S. V. Buldyrev, S. Sreenivasan, T. Kalisky, R. Cohen, E. Lopez, S. Havlin, and H. E. Stanley, Optimal path and minimal spanning trees in random weighted networks, International Journal of Bifurcation and Chaos 17 (2007), 2215–2255.
50. M. Blatt, S. Wiseman, and E. Domany, Superparamagnetic clustering of data, Physical Review Letters 76 (1996), 3251–3254.
51. R. Cohen, D. ben-Avraham, and S. Havlin, Percolation critical exponents in scale free networks, Physical Review E 66 (2002), 036113.
52. S. Carmi, R. Cohen, and D. Dolev, Searching complex networks efficiently with minimal information, Europhysics Letters 74 (2006), 1102–1108.
53. Q. Chen, H. Chang, R. Govindan, and S. Jamin, The origin of power laws in internet topologies revisited, INFOCOM 2002. Proceedings of the Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies 2 (2002), 608–617.
54. S. Carmi, S. Carter, J. Sun, and D. Ben-Avraham, Asymptotic behavior of the kleinberg model, Physical Review Letters 102 (2009), 238702.
55. R. Cohen, K. Erez, D. ben-Avraham, and S. Havlin, Resilience of the Internet to random breakdown, Physical Review Letters 85 (2000), 4626–4628.
56. R. Cohen, K. Erez, D. ben-Avraham, and S. Havlin, Breakdown of the Internet under intentional attack, Physical Review Letters 86 (2001), 3682–3685.
57. J. Camacho, R. Guimerà, and L.A.N. Amaral,Robustpatterns in foodweb structure, Physical Review Letters 88 (2002), 228102.
58. R. Cohen and S. Havlin, Scale free networks are ultrasmall, Physical Review Letters 90 (2003), 058701.
59. R. Cohen, S. Havlin, and D. ben-Avraham, Structural properties of scale free networks, in Handbook of Graphs and Networks, S. Bornholdt and H. G. Schuster, eds., 2002. Berlin: Wiley-VCH.
60. R. Cohen, S. Havlin, and D. ben-Avraham, Efficient immunization strategies of computer networks and populations, Physical Review Letters 91 (2003), 247901.
61. D.S. Callaway, J.E. Hopcroft, J.M. Kleinberg, M. E. J. Newman, and S.H. Strogatz, Are randomly grown graphs really random?, Physical Review E 64 (2001), 041902.
62. S. Carmi, S. Havlin, S. Kirkpatrick,Y. Shavitt, and E. Shir, From the cover: a model of Internet topology using k-shell decomposition, Proceedings of the National Academy of Sciences of the USA 104 (2007), 11150–11154.
63. F. R. K. Chung, Spectral Graph Theory, CBMS Regional Conference Series in Mathematics, no. 92, 1997. Providence, RI: American Mathematical Society.
64. F. Chung and L. Lu, The diameter of sparse random graphs, Advances in Applied Mathematics 26 (2001), 257–279.
65. F. Chung and L. Lu, The average distance in random graphs with given expected degrees, Proceedings of the National Academy of Sciences of the USA 99 (2002), 15879– 15882.
66. Y. Chen, E. Lopez, S. Havlin, and H. E. Stanley, Universal behavior of optimal paths in weighted networks with general disorder, Physical Review Letters 96 (2006), 068702.
67. T. H. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, 1990. Cambridge, MA: MIT Press.
68. A. Clauset and C. Moore, Accuracy and scaling phenomena in Internet mapping, Physical Review Letters 94 (2005), 018701.
69. M. Cieplak, A. Maritan, and J. R. Banavar, Optimal paths and growth processes, Physica A 266 (1999), 291–298.
70. D. S. Callaway, M. E. J. Newman, S. H. Strogatz, and D. J. Watts, Network robustness and fragility: percolation on random graphs, Physical Review Letters 85 (2000), 5468–5471.
71. A. Coniglio, Fractal structure of ising and potts clusters: exact results, Physical Review Letters 62 (1989), 3054–3057.
72. L. Cowen, Compact routing with minimum stretch, Journal of Algorithms 38 (2001), 170–183.
73. Y. Chen, G. Paul, S. Havlin, F. Liljeros, and H. E. Stanley, Finding a better immunization strategy, Physical Review Letters 101 (2008), 058701.
74. R. Cohen, A. F. Rozenfeld, N. Schwartz, D. ben-Avraham, and S. Havlin, Directed and non-directed scale free networks, Proceedings of the XVIII Sitges Conference, R. Pastor- Satorras and J. M. Rubi, eds., Lecture Notes in Physics, volume 625, 2003, p. 23. Berlin: Springer.
75. R. F. I. Cancho and R. V. Sole, The small world of human language, Proceedings of the Royal Society of London, Series B, Biological Sciences 268 (2001), 2261–2266.
76. Z. Dezso and A.-L. Barabàsi, Halting viruses in scale free networks, Physical Review E 65 (2002), 055103(R).
77. J. Dall and M. Christensen, Random geometric graphs, Physical Review E 66 (2002), 016121.
78. R. De Castro and J. W. Grossman, Famous trails to Paul Erdos, Mathematical Intelligencer 21 (1999), 51–63.
79. R. Dobrin and P.M. Duxbury, Minimum spanning trees on random networks, Physical Review Letters 86 (2001), 5076–5079.
80. S. N. Dorogovtsev and A. V. Goltsev, Critical phenomena in complex networks, Reviews of Modern Physics 80 (2008), 1275–1335.
81. S. N. Dorogovtsev, A. V. Goltsev, and J. F. Mendes, Pseudofractal scale-free web, Physical Review E 65 (2002), 066122.
82. S. N. Dorogovtsev, A. V. Goltsev, and J. F. F. Mendes, Ising model on networks with an arbitrary distribution of connections, Physical Review E 66 (2002), 016104.
83. S. N. Dorogovtsev, A. V. Goltsev, and J. F. F. Mendes, k-Core organization of complex networks, Physical Review Letters 96 (2006), 040601.
84. S. N. Dorogovtsev and J. F. F. Mendes, Comment on “breakdown of the Internet under intentional attack,” Physical Review Letters 87 (2001), 219801.
85. S. N. Dorogovtsev and J. F. F. Mendes, Language as an evolving word web, Proceedings of the Royal Society of London, Series B 268 (2001), 2603.
86. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of networks, Advances in Physics 51 (2002)
87. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of Networks: From Biological Nets to the Internet and, 2003. Oxford: Oxford University Press.
88. S. N. Dorogovtsev, J. F. F. Mendes, and J. G. Oliveira, Degree-dependent intervertex separation in complex networks, Physical Review E 73 (2006), 056122.
89. S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, Growing network with heritable connectivity of nodes, ArXiv Condensed Matter e-prints (2000).
90. S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, Anomalous percolating properties of growing networks, Physical Review E 64 (2001), 066110.
91. S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, Giant strongly connected component of directed networks, Physical Review E 64 (2001), 025101(R).
92. S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, Size-dependent degree distribution of a scale-free growing network, Physical Review E 63 (2001), 062101.
93. S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, Metric structure of random networks, Nuclear Physics B 653 (2003), 307.
94. J. P. Doye, Network topology of a potential energy landscape: a static scale-free network, Physical Review Letters 88 (2002), 238701.
95. D. J. de Solla Price, Networks of scientific papers, Science 149 (1965), 510–515.
96. G. F. Davis, M. Yoo, and W. E. Baker, The small world of the American corporate elite, 1982–2001, Strategic Organization 1 (2003), 301–326.
97. V. M. Eguiluz, D. R. Chialvo, G. A. Cecchi, M. Baliki, and A. V. Apkarian, Scalefree brain functional networks, Physical Review Letters 94 (2005), 018102.
98. E. Eisenberg and E. Y. Levanon, Preferential attachment in the protein network evolution, Physical Review Letters 91 (2003), 138701.
99. H. Ebel, L.-I. Mielsch, and S. Bornholdt, Scale-free topology of e-mail networks, Physical Review E 66 (2002), 035103(R).
100. P. Erdos and A. Rènyi, On random graphs, Publicationes Mathematicae 6 (1959), 290–297.
101. P. Erdos and A. Rènyi, On the evolution of random graphs, Publications of the Mathematical Institute of the Hungarian Academy of Sciences 5 (1960), 17–61.
102. P. Erdos and A. Rènyi, On the strength of connectedness of a random graph, Acta Mathematica Scientia Hungary 12 (1961), 261–267.
103. I. J. Farkas, I. Derènyi, A.-L. Barabàsi, and T. Vicsek, Spectra of “real-world” graphs: beyond the semicircle law, Physical Review E 64 (2001), 026704.
104. J. Feder, Fractals, 1988. New York: Plenum Press.
105. U. Feige, Collecting coupons on trees, and the cover time of random walks, Computational Complexity 6 (1997), 341–356.
106. W. Feller, An Introduction to Probability Theory and its Applications, volume 1, 1968. New York: Wiley.
107. S. L. Feld, The focused organization of social ties, American Journal of Sociology 86 (1981), 1015.
108. M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the Internet topology, Computer Communication Review 29 (1999), 251.
109. P. Frojdh, M. Howard, and K. B. Lauritsen, Directed percolation and other systems with absorbing states: Impact of boundaries, International Journal of Modern Physics B 15 (2001), 1761.
110. R. Ferrer i Cancho, C. Janssen, and R. V. Solè, Topology of technology graphs: small world patterns in electronic circuits, Physical Review E 64 (2001), no. 4, 046119.
111. P. J. Flory, Molecular size distribution in three dimensional polymers. iii. tetrafunctional branching units, Journal of the American Chemical Society 63 (1941), 3096–3100.
112. L. K. Gallos and P. Argyrakis, Absence of kinetic effects in reaction-diffusion processes in scale-free networks, Physical Review Letters 92 (2004), 138301.
113. A. Garas, P. Argyrakis, and S. Havlin, The structural role of weak and strong links in a financial market network, European Physical Journal B 63 (2008), 265–271.
114. L. K. Gallos, R. Cohen, P. Argyrakis, A. Bunde, and S. Havlin, Stability and topology of scale-free networks under attack and defense strategies, Physical Review Letters 94 (2005), 188701.
115. K.-I. Goh, M. E. Cusick, D. Valle, B. Childs, M. Vidal, and A.-L. Barabási, The human disease network, Proceedings of the Academy of Sciences of the USA 104 (2007), 8685–8690.
116. A. V. Goltsev, S. N. Dorogovtsev, and J. F. F. Mendes, Critical phenomena in networks, Physical Review E 67 (2002), 026123.
117. A.V. Goltsev, S.N. Dorogovtsev, and J. F. F. Mendes, k-core (boot-strap) percolation on complex networks: critical phenomena and nonlocal effects, Physical ReviewE 73 (2006), 056101.
118. A. V. Goltsev, S. N. Dorogovtsev, and J. F. F. Mendes, Percolation on correlated networks, Physical Review E 78 (2008), 051105.
119. X. Guardiola, R. Guimera, A. Arenas, A. Diaz-Guilera, D. Streib, and L. A. N. Amaral, Macro- and micro-structure of trust networks, ArXiv Condensed Matter e-prints (2002).
120. M. C. González, C. A. Hidalgo, and A.-L. Barabási, Understanding individual human mobility patterns, Nature 453 (2008), 779–782.
121. J. W. Grossman and P. D. F. Ion, On a portion of the well-known collaboration graph, Congressus Numerantium 108 (1995), 129–131.
122. K.-I. Goh, B. Kahng, and D. Kim, Spectra and eigenvectors of scale-free networks, Physical Review E 64 (2001), no. 5, 051903.
123. K.-I. Goh, B. Kahng, and D. Kim, Universal behavior of load distribution in scale-free networks, Physical Review Letters 87 (2001), 278701.
124. L. K. Gallos, F. Liljeros, P. Argyrakis, A. Bunde, and S. Havlin, Improving immunization strategies, Physical Review E 75 (2007), 045104.
125. C. Gkantsidis, M. Mihail, and A. Saberi, Conductance and congestion in power law graphs, SIGMETRICS, 2003, pp. 148–159. New York: ACM.
126. M. Girvan and M. E. J. Newman, Community structure in social and biological networks, Proceedings of the National Academy of Sciences of the USA 99 (2002), 7821– 7826.
127. K.-I. Goh, E. S. Oh, H. Jeong, B. Kahng, and D. Kim, Classification of scale free networks, Proceedings of the National Academy of Sciences of the USA 99 (2002), 12583.
128. P. Grassberger, On the critical behavior of the general epidemic process and dynamical percolation, Mathematical Biosciences 63 (1983), 157.
129. K.-I. Goh, G. Salvi, B. Kahng, and D. Kim, Skeleton and fractal scaling in complex networks, Physical Review Letters 96 (2006), 018701.
130. L. K. Gallos, C. Song, and H. A. Makse, Scaling of degree correlations and its influence on diffusion in scale-free networks, Physical Review Letters 100 (2008), 248701.
131. H. W. Hethcote and J. W. Van Ark, Epidemiological models for heterogeneous populations: proportionate mixing, parameter estimation and immunization programs, Mathematical Biosciences 84 (1987), 85–118.
132. S. Havlin and D. ben-Avraham, Diffusion in disordered media, Advances in Physics 36 (1987), 695.
133. S. Havlin, L. A. Braunstein, S. V. Buldyrev, R. Cohen, T. Kalisky, S. Sreenivasan, and H. Eugene Stanley, Optimal path in random networks with disorder: a mini review, Physica A 346 (2005), 82–92.
134. L. Hufnagel, D. Brockmann, and T. Geisel, The scaling laws of human travel, Nature 439 (2006), 462–465.
135. C. Herrmann, M. Barthelemy, and P. Provero, Connectivity distribution of spatial networks, Physical Review E 68 (2003), 026128.
136. M. Huxham, S. Beaney, and D. Raffaelli, Do parasites reduce the chances of triangulation in a real food web?, Oikos 76 (1996), 284–300.
137. Y. He, Z. J. Chen, and A. C. Evans, Small-world anatomical networks in the human brain revealed by cortical thickness from MRI, Cerebral Cortex 17 (2007), 2407–2419.
138. D. R. Hofstadter, Energy levels and wave functions of bloch electrons in rational and irrational magnetic fields, Physical Review B 14 (1976), 2239–2249.
139. P. Holme, Efficient local strategies for vaccination and network attack, Europhysics Letters 68 (2004), 908–914.
140. J. A. Holyst, J. Sienkiewicz, A. Fronczak, P. Fronczak, and K. Suchecki, Scaling of distances in correlated complex networks, Physica A 351 (2005), 167–174.
141. S. Itzkovitz and U. Alon, Subgraphs and network motifs in geometric networks, Physical Review E 71 (2005), 026117.
142. S. Itzkovitz, R. Milo, N. Kashtan, G. Ziv, and U. Alon, Subgraphs in random networks, Physical Review E 68 (2003), 026127.
143. L. Jahnke, J. W. Kantelhardt, R. Berkovits, and S. Havlin, Wave localization in complex networks with high clustering, Physical Review Letters 101 (2008), 175702.
144. S. Jung, S. Kim, and B. Kahng, Geometric fractal growth model for scale-free networks, Physical Review E 65 (2002), 056101.
145. L. Jing, H. Keqing, M. Yutao, and P. Rong, Scale free in software metrics, Proceedings of the 30th Annual International Computer Software and Applications Conference (COMPSAC’06), 2006. New York: IEEE.
146. H. Jeong, S. Mason, A.-L. Barabási, and Z. N. Oltvai, Lethality and centrality in protein networks, Nature 411 (2001), 41.
147. H. Jeong, Z. èNda, and A. L. Barabási, Measuring preferential attachment in evolving networks, Europhysics Letters 61 (2003), 567.
148. H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai, and A. L. Barabási, The large-scale organization of metabolic networks, Nature 407 (2000), 651.
149. T. Kalisky, L. A. Braunstein, S. V. Buldyrev, S. Havlin, and H. E. Stanley, Scaling of optimal-path-lengths distribution in complex networks, Physical Review E 72 (2005), no. 2, 025102.
150. T. Kalisky, R. Cohen, O. Mokryn, D. Dolev, Y. Shavitt, and S. Havlin, Tomography of scale-free networks and shortest path trees, Physical Review E 74 (2006), 066108.
151. D. Krioukov, K. Fall, and X. Yang, Compact routing on internet-like graphs, Proceedings of IEEE INFOCOM, 2004. New York: IEEE.
152. K. Kosmidis, S. Havlin, and A. Bunde, Structural properties of spatially embedded networks, Europhysics Letters 82 (2008), 48005.
153. B. J. Kim, Geographical coarse graining of complex networks, Physical Review Letters 93 (2004), 168701.
154. N. Kashtan, S. Itzkovitz, R. Milo, and U. Alon, Topological generalizations of network motifs, Physical Review E 70 (2004), 031909.
155. L. Kullmann, J. Kertèsz, and K. Kaski, Time-dependent cross-correlations between different stock returns: a directed network of influence, Physical Review E 66 (2002), 026125.
156. J. M. Kleinberg, Navigation in a small world, Nature 406 (2000), 845.
157. J. M. Kleinberg, The small-world phenomenon: an algorithm perspective, Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000, pp. 163–170. New York: ACM.
158. D. E. Knuth, The Stanford Graphbase: a Platform for Combinatorial Computing, 1993. New York: ACM.
159. J. M. Kumpula, J. P. Onnela, J. Saramáki, K. Kaski, and J. Kertèsz, Emergence of communities in weighted networks, Physical Review Letters 99 (2007), 228701.
160. P. L. Krapivsky and S. Redner, Organization of growing random networks, Physical Review E 63 (2001), 066123.
161. P. L. Krapivsky and S. Redner, Network growth by copying, Physical Review E 71 (2005), 036118.
162. E. Kenah and J. M. Robins, Second look at the spread of epidemics on networks, Physical Review E 76 (2007), 036113.
163. P. L. Krapivsky, S. Redner, and F. Leyvraz, Connectivity of growing random networks, Physical Review Letters 85 (2000), 4629–4632.
164. J. Koplik, S. Redner, and D. Wilkinson, Transport and dispersion in random networks with percolation disorder, Physical Review A 37 (1988), 2619–2636.
165. I. Kanter and H. Sompolinsky, Mean-field theory of spin-glasses with finite coordination number, Physical Review Letters 58 (1987), 164–167.
166. J. Klafter, M. F. Shlesinger, and G. Zumofen, Beyond Brownian motion, Physics Today 49 (1996), 33.
167. J. O. Kephart, S. R. White, and D. M. Chess, Computers and epidemiology, IEEE Spectrum 30 (1993), 26–30.
168. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, Geometric ad-hoc routing: Of theory and practice, Proceedings of the 22nd Annual Symposium on Principles ofDistributed Computing, 2003, pp. 63–72. New York: ACM.
169. F. Kuhn and A. Zollinger, Ad-hoc networks beyond unit disk graphs, Proceedings of the 2003 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC, 2003, pp. 69–78. New York: ACM.
170. A. Lakhina, J. Byers, M. Crovella, and P. Xie, Sampling biases in ip topology measurements, Proceedings of IEEE INFOCOM’03, 2003. New York: IEEE.
171. E. Lòpez, S. Carmi, S. Havlin, S. V. Buldyrev, and H. E. Stanley, Anomalous electrical and frictionless flow conductance in complex networks, Physica D 224 (2006), 69–76.
172. F. Liljeros, C. R. Edling, L. A. N. Amaral, H. E. Stanley, and Y. Aberg, The web of human sexual contacts, Nature 411 (2001), 907–908.
173. F. Liljeros, C. R. Edling, and L. A. N. Amaral, Sexual networks: implications for the transmission of sexually transmitted infections, Microbes and Infection 5 (2003), 189– 196(8).
174. P. Lèvy, Calcul des Probabilities, 1925. Paris: Gauthier Villars.
175. A. L. Lloyd and R. M. May, How viruses spread among computers and people, Science 292 (2001), 1316–1317.
176. L. Lovász, RandomWalks on Graphs: A Survey, Combinatorics, Paul Erd?os is Eighty (D. Mikls, V. T. Sos, and T. Sz?onyi, eds.), volume 2, J´anos Bolyai Mathematical Society, Budapest, 1996, pp. 353–398.
177. W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson, On the self-similar nature of ethernet traffic (extended version), IEEE/ACM Transactions on Networking 2 (1994), 1–15.
178. M. Leone, A. Vazquez, A. Vespignani, and R. Zecchina, Ferromagnetic ordering in graphs with arbitrary degree distribution, European Physical Journal B 28 (2002), 191–197.
179. R. M. May and R. M. Anderson, Spatial heterogeneity and the design of immunization programs, Mathematical Biosciences 72 (1984), 83–111.
180. D. Magoni, Tearing down the Internet, IEEE Journal on Selected Areas in Communications 21 (2003), 949–960.
181. B. B. Mandelbrot, The Fractal Geometry of Nature, 1982. San Francisco, CA: Freeman.
182. N. D. Martinez, Artifacts or attributes? Effects of resolution on the Little Rock Lake food web, Ecological Monographs 61 (1991), 367–392.
183. R. Milo, S. Itzkovitz, N. Kashtan, R. Levitt, and U. Alon, Response to Comment on “Network motifs: simple building blocks of complex networks” and “Superfamilies of evolved and designed networks,” Science 305 (2004)
184. S. Milgram, The small world prob lem, Psychology Today 2 (1967), 60–67.
185. J. C. Miller, Epidemic size and probability in populations with heterogeneous infectivity and susceptibility, Physical Review E 76 (2007), 010101.
186. N. Madar, T. Kalisky, R. Cohen, D. ben-Avraham, and S. Havlin, Immunization and epidemic dynamics in complex networks, European Physical Journal B 38 (2004), 269–276.
187. A. E. Motter and Y.-C. Lai, Cascade-based attacks on complex networks, Physical Review E 66 (2002), 065102.
188. A. E. Motter, Cascade control and defense in complex networks, Physical Review Letters 93 (2004), 098701.
189. Y. Moreno, R. Pastor-Satorras, and A. Vespignani, Epidemic outbreaks in complex heterogeneous networks, European Physical Journal B 26 (2002), 521–529.
190. M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Structures and Algorithms 6 (1995), 161.
191. M. Molloy and B. Reed, The size of the giant component of a random graph with a given degree sequence, Combinatorics, Probability and Computing 7 (1998), 295.
192. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, Equation of state calculations by fast computing machines, Journal of Chemical Physics 21 (1953), 1087–1092.
193. S. S. Manna and P. Sen, Modulated scale-free network in Euclidean space, Physical Review E 66 (2002), 066114.
194. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, Network motifs: simple building blocks of complex networks, Science 298 (2002), 824–827.
195. M. Mihail, A. Saberi, and P. Tetali, Random walks with lookahead on power law random graphs, Internet Mathematics 3 (2006), 147–152.
196. A. E. Motter and Z. Toroczkai, Optimization in networks, Chaos 17 (2007), 026101.
197. D. Mancardi, G. Varetto, E. Bucci, F. Maniero, and C. Guiot, Fractal parameters and vascular networks: facts and artifacts, Theoretical Biology and Medical Modelling 5 (2008), no. 1, 12.
198. M. E. J. Newman, Scientific collaboration networks. i. network construction and fundamental results, Physical Review E 64 (2001), 016131.
199. M. E. J. Newman, The structure of scientific collaboration networks, Proceedings of the National Academy of Sciences of the USA 98 (2001), no. 2, 404–409.
200. M. E. J. Newman, Assortative mixing in networks, Physical Review Letters 89 (2002), 208701.
201. M. E. J. Newman, Structure and function of complex networks, SIAM Review 45 (2002), 167–256.
202. M. E. J. Newman, The spread of epidemic disease on networks, Physical Review E 66 (2002), 016128.
203. M. E. J. Newman, Ego-centered networks and the ripple effect, Social Networks 25 (2003), 83–95.
204. M. E. J. Newman, Mixing patterns in networks, Physical Review E 67 (2003), 026126.
205. M. E. J. Newman, Finding community structure in networks using the eigenvectors of matrices, Physical Review E 74 (2006), 036104.
206. M. E. J. Newman, S. Forrest, and J. Balthrop, Email networks and the spread of computer viruses, Physical Review E 66 (2002), 035101.
207. M. E. Newman and M. Girvan, Finding and evaluating community structure in networks, Physical Review E 69 (2004), 026113.
208. M. E. J. Newman, S. H. Strogatz, and D. J. Watts, Random graphs with arbitrary degree distributions and their applications, Physical Review E 64 (2001), 026118.
209. M. E. J. Newman and D. J. Watts, Scaling and percolation in the small-world network model, Physical Review E 60 (1999), 7332.
210. M. E. J. Newman, D. J. Watts, and S. H. Strogatz, Random graph models of social networks, Proceedings of the National Academy of Sciences of the USA 99 (2002), 2566.
211. M. E. J. Newman and R. M. Ziff, A fast Monte Carlo algorithm for site or bond percolation, Physical Review E 64 (2001), 016706.
212. J.-P. Onnela, K. Kaski, and J. Kertèsz, Clustering and information in correlation based financial networks, European Physical Journal B 38 (2004), 353–362.
213. L. Onsager, Crystal statistics. i. a two-dimensional model with an order-disorder transition, Physical Review 65 (1944), 117–149.
214. V. Paxson, End-to-end routing behavior in the internet, IEEE/ACM Transactions on Networking 5 (1997), 601–615.
215. L. Page, S. Brin, R. Motwani, and T. Winograd, The pagerank citation ranking: Bringing order to the web, Technical Report, Stanford InfoLab, 1999.
216. G. Palla, A.-L. Barabási, and T. Vicsek, Quantifying social group evolution, Nature 446 (2007), 664–667.
217. G. Paul, R. Cohen, S. Sreenivasan, S. Havlin, and H. E. Stanley, Graph partitioning induced phase transitions, Physical Review Letters 99 (2007), no. 11, 115701.
218. J. Park and M. E. J. Newman, Origin of degree correlations in the internet and other networks, Physical Review E 68 (2003), 026112.
219. T. Petermann and P. De Los Rios, Exploration of scale-free networks, European Physical Journal B 38 (2004), 201.
220. A. Pikovsky, M. Rosenblum, and J. Kurths, Synchronization: A Universal Concept in Nonlinear Sciences, Cambridge Nonlinear Science Series, 2003. Cambridge: Cambridge University Press.
221. M. Porto, N. Schwartz, S. Havlin, and A. Bunde, Optimal paths in disordered media: scaling of the crossover from self-similar to self-affine behavior, Physical Review E 60 (1999), 2448–2451.
222. G. Paul, S. Sreenivasan, and H. E. Stanley, Resilience of complex networks to random breakdown, Physical Review E 72 (2005), 056130.
223. G. Paul, T. Tanizawa, S. Havlin, and H. E. Stanley, Optimization of robustness of complex networks, European Physical Journal B 38 (2004), 187–191.
224. D. Peleg and E. Upfal, A tradeoff between space and efficiency for routing tables, Journal of the ACM 36 (1989), 510–530.
225. R. Pastor-Satorras and A. Vespignani, Epidemic dynamics and endemic states in complex networks, Physical Review E 63 (2001), 066117.
226. R. Pastor-Satorras and A. Vespignani, Epidemic spreading in scale-free networks, Physical Review Letters 86 (2001), 3200–3203.
227. R. Pastor-Satorras and A. Vespignani, Immunization of complex networks, Physical Review E 65 (2002), 036104.
228. R. Pastor-Satorras and A. Vespignani, Evolution and Structure of the Internet: a Statistical Physics Approach, 2003. Cambridge: Cambridge University Press.
229. R. Pastor-Satorras, A. Vázquez, and A. Vespignani, Dynamical and correlation properties of the internet, Physical Review Letters 87 (2001), 258701.
230. K. Park and W. Willinger, Self-Similar Network Traffic and Performance Evaluation, 2000. New York: Wiley.
231. A. Rapoport, A contribution to the theory of random and biased nets, Bulletin of Mathematical Biophysics 19 (1957), 257–271.
232. E. Ravasz and A.-L. Barabási, Hierarchical organization in complex networks, Physical Review E 67 (2003), 026112
233. H. D. Rozenfeld and D. ben-Avraham, Designer nets from local strategies, Physical Review E 70 (2004), 056107.
234. M. R. Roberson and D. ben-Avraham, Kleinberg navigation in fractal small-world networks, Physical Review E 74 (2006), 017101.
235. A. F. Rozenfeld, R. Cohen, D. ben-Avraham, and S. Havlin, Scale free networks on lattices, Physical Review Letters 89 (2002), 218701.
236. S. Redner, How popular is your paper? An empirical study of the citation distribution, European Physical Journal B 4 (1998), 131–134.
237. M. Ripeanu, I. Foster, and A. Iamnitchi, Mapping the Gnutella network: properties of large-scale peer-to-peer systems and implications for system design, IEEE Internet Computing 6 (2002), 50–57.
238. M. Rosvall, A. Gronlund, P. Minnhagen, and K. Sneppen, Searchability of networks, Physical Review E 72 (2005), 046117.
239. H. D. Rozenfeld, S. Havlin, and D. ben-Avraham, Fractal and transfractal recursive scale-free nets, New Journal of Physics 9 (2007), 175.
240. M. Rosvall, P. Minnhagen, and K. Sneppen, Navigating networks with limited information, Physical Review E 71 (2005), 066111.
241. E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai, and A.-L. Barabási, Hierarchical organization of modularity in metabolic networks, Science 297 (2002), 1551– 1555.
242. D. Stauffer and A. Aharony, Introduction to Percolation Theory, second edition, 1994. London: Taylor and Francis.
243. G. Szabò, M. Alava, and J. Kertèsz, Shortest paths and load scaling in scale free trees, Physical Review E 66 (2002), 026101.
244. J. Shao, S. V. Buldyrev, R. Cohen, M. Kitsak, S. Havlin, and H. E. Stanley, Fractal boundaries of complex networks, Europhysics Letters 84 (2008), 48004.
245. P. Sen and B. K. Chakrabarti, Small-world phenomena and the statistics of linear polymers, Journal of Physics A 34 (2001), 7749–7755.
246. N. Schwartz, R. Cohen, D. ben Avraham, S. Havlin, and A.-L. Barabási, Percolation in directed scale-free networks, Physical Review E 66 (2002), 015104(R).
247. S. Sreenivasan, R. Cohen, E. Lopez, Z. Toroczkai, and H. E. Stanley, Structural bottlenecks for communication in networks, Physical Review E 75 (2007), 036105.
248. P. Sen, S. Dasgupta, A. Chatterjee, P. A. Sreeram, G. Mukherjee, and S. S. Manna, Small-world properties of the Indian railway network, Physical Review E 67 (2003), 036106.
249. A. N. Samukhin, S. N. Dorogovtsev, and J. F. F. Mendes, Laplacian spectra of, and random walks on, complex networks: are scale-free architectures really important?, Physical Review E 77 (2008), 036115.
250. C. Song, L. K. Gallos, S. Havlin, and H. A. Makse, How to calculate the fractal dimension of a complex network: the box covering algorithm, Journal of Statistical Mechanics: Theory and Experiment 2007 (2007), P 03006.
251. Y. M. Strelniker, S. Havlin, R. Berkovits, and A. Frydman, Resistance distribution in the hopping percolation model, Physical Review E 72 (2005), 016121
252. C. Song, S. Havlin, and H. A. Makse, Self-similarity of complex networks, Nature 433 (2005), 392–395.
253. C. Song, S. Havlin, and H. A. Makse, Origins of fractality in the growth of complex networks, Nature Physics 2 (2006), 275–281.
254. A. Sinclair, Algorithms for Random Generation and Counting: A Markov Chain Approach, progress in theoretical computer science, 1993. Boston, MA: Birkh¨auser.
255. M. F. Shlesinger and J. Klafter, Accelerated diffusion in Josephson junctions and related chaotic systems, Physical Review Letters 54 (1985), 2551.
256. M. Sade, T. Kalisky, S. Havlin, and R. Berkovits, Localization transition on complex networks via spectral statistics, Physical Review E 72 (2005), 066123.
257. J. Saramaki, M. Kivela, J.-P. Onnela, K. Kaski, and J. Kertesz, Generalizations of the clustering coefficient to weighted complex networks, Physical Review E 75 (2007), 027105.
258. R. V. Sole and J. M. Montoya, Complexity and fragility in ecological networks, Proceedings of the Royal Society of London, Series B 268 (2001), 2039.
259. S. Shen-Orr, R. Milo, S. Mangan, and U. Alon, Network motifs in the transcriptional regulation network of escherichia coli, Nature Genetics 31 (2002), 64–68.
260. M. Sipser and D. A. Spielman, Expander codes, IEEE Transactions on Information Theory 42 (1996), 1710–1722.
261. Y. Shavitt and E. Shir, Dimes: let the internet measure itself, Computer Communication Review 35 (2005), 71–74.
262. S. H. Strogatz, Exploring complex networks, Nature 410 (2000), 268–276.
263. S. Strogatz, Sync: The Emerging Science of Spontaneous Order, 2003. New York: Hyperion.
264. K. Sneppen, A. Trusina, and M. Rosvall, Hide-and-seek on complex networks, Europhysics Letters 69 (2005), 853–859.
265. M. F. Shlesinger, G. M. Zaslavsky, and J. Klafter, Strange kinetics, Nature 363 (1993), 31–37.
266. T. Tanizawa, G. Paul, R. Cohen, S. Havlin, and H. E. Stanley, Optimization of network robustness to waves of targeted and random attacks, Physical Review E 71 (2005), 047101.
267. A. Trusina, M. Rosvall, and K. Sneppen, Communication boundaries in networks, Physical Review Letters 94 (2005), 238701.
268. M. Thorup and U. Zwick, Compact routing schemes, Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, 2001. New York: ACM.
269. V. V. Vazirani, Approximation Algorithms, 2004. Berlin: Springer.
270. G. M. Viswanathan, F. Bartumeus, S.V. Buldyrev, J. Catalan, U. L. Fulco, S. Havlin, M. G. E. da Luz, M. L. Lyra, E. P. Raposo, and H. E. Stanley, Levy flight random searches in biological phenomena, Physica A 314 (2002), 208–213.
271. G. M. Viswanathan, S. V. Buldyrev, S. Havlin, M. G. da Luz, E. P. Raposo, and H. E. Stanley, Optimizing the success of random searches, Nature 401 (1999), 911–914.
272. S. Valverde, R. Ferrer Cancho, and R. V. Solè, Mixing patterns in networks, Europhysics Letters 60 (2002), 512–517.
273. R. van der Hofstad, G. Hooghiemstra, and P. van Mieghem, First passage percolation on the random graph, Probability in the Engineering and Informational Sciences 15 (2001), 225–237.
274. A. Vazquez, R. Pastor-Satorras, and A. Vespignani, Internet topology at the router and autonomous system level, Condensed Matter (2002), 0206084.
275. A. X. C. N. Valente, A. Sarkar, and H. A. Stone, Two-peak and three-peak optimal complex networks, Physical Review Letters 92 (2004), 118702.
276. D. J. Watts, Small Worlds, 1999. Princeton, NJ: Princeton University Press.
277. D. J. Watts, Six Degrees: The Science of a Connected Age, 2003. New York: W. W. Norton.
278. Z. Wu, L. A. Braunstein, V. Colizza, R. Cohen, S. Havlin, and H. E. Stanley, Optimal paths in complex networks with correlated weights: the worldwide airport network, Physical Review E 74 (2006), 056104.
279. G. B. West, J. H. Brown, and B. J. Enquist, A general model for the origin of allometric scaling laws in biology, Science 276 (1997), 122–126.
280. Z. Wu, L. A. Braunstein, S. Havlin, and H. E. Stanley, Transport in weighted networks: partition into superhighways and roads, Physical Review Letters 96 (2006), 148702.
281. D. J. Watts, P. S. Dodds, and M. E. J. Newman, Identity and search in social networks, Science 296 (2002), 1302–1305.
282. G. H. Weiss, Aspects and applications of the random walk, 1994. Amsterdam: North- Holland.
283. P. Wang, M. C. Gonzalez, C. A. Hidalgo, and A.-L. Barabási, Understanding the spreading patterns of mobile phone viruses, Science 324 (2009), 1071–1076.
284. E. P. Wigner, Characteristic vectors of bordered matrices with infinite dimensions, Annals of Mathematics 62 (1955), 548–564.
285. H. S. Wilf, Generating functionology, 1994. London: Academic Press.
286. D. J. Watts and S. H. Strogatz, Collective dynamics of “small world” networks, Nature 393 (1998), 440–442.
287. C. P. Warren, L. M. Sander, and I. M. Sokolov, Firewalls, disorder, and percolation in networks, Mathematical Biosciences 180 (2002), 293.
288. C. P. Warren, L. M. Sander, and I. M. Sokolov, Geography in a scale-free network model, Physical Review E 66 (2002), 56105.
289. J. G. White, E. Southgate, J. N. Thomson, and S. Brenner, The structure of the nervous system of the nematode caenorhabditis elegans, Philosophical Transactions of the Royal Society of London, Series B 314 (1986), 1–340.
290. W. H. Wethcote and J. A. Yorke, Gonorrhea Transmission Dynamics and Control, Lecture notes in Biomathematics, volume 56, 1984. Berlin: Springer.
291. I. Xenarios, L. Salwinski, X. J. Duan, P. Higney, S.-M. Kim, and D. Eisenberg, DIP, the database of interacting proteins: a research tool for studying cellular networks of protein interactions, Nucleic Acids Research 30 (2002), 303–305.
292. S.-H. Yook, H. Jeong, and A.-L. Barabási, Modeling the Internet’s large-scale topology, Proceedings of the National Academy of Sciences of the USA 99 (2002), 13382–13386.
293. A. Zilman, J. Kieffer, F. Molino, G. Porte, and S. A. Safran, Entropic phase separation in polymer-microemulsion networks, Physical Review Letters 91 (2003), 015901.