The structure and dynamics of networks

The Structure and Dynamics of Networks

Volumn 9781400841356, Issue , 2011, Pages 1-582

  Newman, Mark E J ^a   Barabási, Albert László ^b   Watts, Duncan J ^a,c  

^a SANTA FE INSTITUTE   (Mexico)

^b UNIVERSITY OF NOTRE DAME   (United States)

^c Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SYSTEMS;

CUTTING EDGES; DISEASE TRANSMISSION; NETWORK ROBUSTNESS; NETWORK SCIENCE; NETWORK STRUCTURES; SPREAD OF DISEASE; STRUCTURE AND DYNAMICS; SYSTEM DYNAMICS;

COMPUTER NETWORKS;

EID: 84924972227     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (328)

1. Adamic, L. A., 1999. The small world web. In Lecture Notes in Computer Science, vol. 1696, pp. 443-454. Springer, New York.
2. Adamic, L. A. and Huberman, B. A., 2000. Power-law distribution of the world wide web. Science 287, 2115.
3. Adamic, L. A., Lukose, R. M., Puniyani, A. R., and Huberman, B. A., 2001. Search in power-law networks. Phys. Rev. E 64, 046135.
4. Adler, J., 1991. Bootstrap percolation. Physica A 171, 453-470.
5. Agrawal, H., 2002. Extreme self-organization in networks constructed from gene expression data. Phys. Rev. Lett. 89, 268702.
6. Ahuja, R. K., Magnanti, T. L., and Orlin, J. B., 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River, NJ.
7. Aiello,W., Chung, F., and Lu, L., 2000. A random graph model for massive graphs. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 171-180. Association of Computing Machinery, New York.
8. Aiello, W., Chung, F., and Lu, L., 2002. Random evolution of massive graphs. In J. Abello, P. M. Pardalos, and M. G. C. Resende (eds.), Handbook of Massive Data Sets, pp. 97-122. Kluwer, Dordrecht.
9. Alberich, R., Miro-Julia, J., and Rossello, F., 2002. Marvel Universe looks almost like a real social network. Preprint cond-mat/0202174.
10. Albert, R. and Barabási, A.-L., 2000. Topology of evolving networks: Local events and universality. Phys. Rev. Lett. 85, 5234-5237.
11. Albert, R. and Barabási, A.-L., 2002. Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47-97.
12. Albert, R., Jeong, H., and Barabási, A.-L., 1999. Diameter of the world-wide web. Nature 401, 130-131.
13. Albert, R., Jeong, H., and Barabási, A.-L., 2000. Attack and error tolerance of complex networks. Nature 406, 378-382.
14. Alberts, B., Johnson, A., Lewis, J., Raff, M., Roberts, K., and Walter, P., 2002. Molecular Biology of the Cell. Garland Publishing, New York, 4th ed.
15. Amaral, L. A. N., Scala, A., Barthélémy, M., and Stanley, H. E., 2000. Classes of small-world networks. Proc. Natl. Acad. Sci. USA 97, 11149-11152.
16. Anderson, C., Wasserman, S., and Crouch, B., 1999. A p* primer: Logit models for social networks. Social Networks 21, 37-66.
17. Anderson, R. M. and May, R. M., 1991. Infectious Diseases of Humans. Oxford University Press, Oxford.
18. Anthonisse, J. M., 1971. The rush in a directed graph. Technical Report BN 9/71, Stichting Mathematicsh Centrum, Amsterdam.
19. Apic, G., Gough, J., and Teichmann, S. A., 2001. Domain combinations in archaeal, eubacterial and eukaryotic proteomes. J. Mol. Biol. 310, 311-325.
20. Bailey, N. T. J., 1975. The Mathematical Theory of Infectious Diseases and Its Applications. Hafner Press, New York.
21. Bak, P., 1996. How NatureWorks: The Science of Self-Organized Criticality. Copernicus, NewYork.
22. Ball, F., Mollison, D., and Scalia-Tomba, G., 1997. Epidemics with two levels of mixing. Annals of Applied Probability 7, 46-89.
23. Balthrop, J., Forrest, S., Newman, M. E. J., and Williamson, M. M., 2004. Technological networks and the spread of computer viruses. Science 304, 527-529.
24. Banks, D. L. and Carley, K. M., 1996. Models for network evolution. Journal of Mathematical Sociology 21, 173-196.
25. Barabási, A.-L., 2002. Linked: The New Science of Networks. Perseus, Cambridge, MA.
26. Barabási, A.-L. and Albert, R., 1999. Emergence of scaling in random networks. Science 286, 509-512.
27. Barabási, A.-L., Albert, R., and Jeong, H., 1999. Mean-field theory for scale-free random networks. Physica A 272, 173-187.
28. Barabási, A.-L., Albert, R., and Jeong, H., 2000a. Scale-free characteristics of random networks:The topology of theWorldWideWeb. Physica A 281, 69-77.
29. Barabási, A.-L., Albert, R., Jeong, H., and Bianconi, G., 2000b. Power-law distribution of the WorldWideWeb. Science 287, 2115a.
30. Barabási, A.-L., Ravasz, E., and Vicsek, T., 2001. Deterministic scale-free networks. Physica A 299, 559-564.
31. Barabási, A.-L., Jeong, H., Ravasz, E., Néda, Z., Schuberts, A., andVicsek, T., 2002. Evolution of the social network of scientific collaborations. Physica A 311, 590-614.
32. Barbour, A. D. and Reinert, G., 2001. Small worlds. Random Structures and Algorithms 19, 54-74.
33. Barrat, A., 1999. Comment on 'Small-world networks: Evidence for crossover picture'. Preprint cond-mat/9903323.
34. Barrat, A. and Weigt, M., 2000. On the properties of small-world networks. Eur. Phys. J. B 13, 547-560.
35. Barthélémy, M., 2003. Comment on 'Universal behavior of load distribution in scale-free networks'. Phys. Rev. Lett. 91, 189803.
36. Barthélémy, M. and Amaral, L. A. N., 1999a. Small-world networks: Evidence for a crossover picture. Phys. Rev. Lett. 82, 3180-3183.
37. Barthélémy, M. and Amaral, L. A. N., 1999b. Erratum: Small-world networks: Evidence for a crossover picture. Phys. Rev. Lett. 82, 5180.
38. Bearman, P. S. and Parigi, P., 2004. Cloning headless frogs and other important matters: Conversation topics and network structure. Social Forces 83, 535-557.
39. Bearman, P. S., Moody, J., and Stovel, K., 2004. Chains of affection: The structure of adolescent romantic and sexual networks. Am. J. Sociol. 110, 44-91.
40. Bender, E. A. and Canfield, E. R., 1978. The asymptotic number of labeled graphs with given degree sequences. Journal of Combinatorial Theory A 24, 296-307.
41. Bharat, K. and Henzinger, M. R., 1998. Improved algorithms for topic distillation in a hyperlinked environment. In Proceedings of the 21st ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 104-111. Association of Computing Machinery, New York.
42. Bianconi, G. and Barabási, A.-L., 2001a. Bose-Einstein condensation in complex networks. Phys. Rev. Lett. 86, 5632-5635.
43. Bianconi, G. and Barabási, A.-L., 2001b. Competition and multiscaling in evolving networks. Europhys. Lett. 54, 436-442.
44. Bianconi, G. and Capocci, A., 2003. Number of loops of size h in growing scale-free networks. Phys. Rev. Lett. 90, 078701.
45. Binney, J. J., Dowrick, N. J., Fisher, A. J., and Newman, M. E. J., 1992. The Theory of Critical Phenomena. Oxford University Press, Oxford.
46. Boguñá, M., Pastor-Satorras, R., Díaz-Guilera, A., and Arenas, A., 2003a. Emergence of clustering, correlations, and communities in a social network model. Preprint cond-mat/0309263.
47. Boguñá, M., Pastor-Satorras, R., and Vespignani, A., 2003b. Epidemic spreading in complex networks with degree correlations. In R. Pastor-Satorras, J. Rubi, and A. Díaz-Guilera (eds.), Statistical Mechanics of Complex Networks, no. 625 in Lecture Notes in Physics, pp. 127-147. Springer, Berlin.
48. Bollobás, B., 2001. Random Graphs. Academic Press, New York, 2nd ed.
49. Bollobás, B. and Riordan, O., 2002. The diameter of a scale-free random graph. Preprint, Department of Mathematical Sciences, University of Memphis.
50. Bollobás, B., Riordan, O., Spencer, J., and Tusnády, G., 2001. The degree sequence of a scale-free random graph process. Random Structures and Algorithms 18, 279-290.
51. Bordens, M. and Gómez, I., 2000. Collaboration networks in science. In H. B. Atkins and B. Cronin (eds.), The Web of Knowledge: A Festschrift in Honor of Eugene Garfield. Information Today, Medford, NJ.
52. Bornholdt, S. and Ebel, H., 2001. WorldWideWeb scaling exponent from Simon's 1955 model. Phys. Rev. E 64, 035104.
53. Boss, M., Elsinger, H., Summer, M., and Thurner, S., 2003. The network topology of the interbank market. Preprint cond-mat/0309582.
54. Brin, S. and Page, L., 1998. The anatomy of a large-scale hypertextualWeb search engine. Computer Networks 30, 107-117.
55. Broadbent, S. R. and Hammersley, J. M., 1957. Percolation processes: I. Crystals and mazes. Proc. Cambridge Philos. Soc. 53, 629-641.
56. Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., andWiener, J., 2000. Graph structure in the web. Computer Networks 33, 309-320.
57. Buchanan, M., 2002. Nexus: Small Worlds and the Groundbreaking Science of Networks. Norton, New York.
58. Bunde, A. and Havlin, S. (eds.), 1994. Fractals in Science. Springer, Berlin.
59. Bunde, A. and Havlin, S. (eds.), 1996. Fractals and Disordered Systems. Springer, Berlin.
60. Burda, Z., Jurkiewicz, J., and Krzywicki, A., 2004. Network transitivity and matrix models. Phys. Rev. E 69, 026106.
61. Caldarelli, G., Pastor-Satorras, R., and Vespignani, A., 2004. Structure of cycles and local ordering in complex networks. Eur. Phys. J. B 38, 183-186.
62. Callaway, D. S., Newman, M. E. J., Strogatz, S. H., andWatts, D. J., 2000. Network robustness and fragility: Percolation on random graphs. Phys. Rev. Lett. 85, 5468-5471.
63. Callaway, D. S., Hopcroft, J. E., Kleinberg, J. M., Newman, M. E. J., and Strogatz, S. H., 2001. Are randomly grown graphs really random? Phys. Rev. E 64, 041902.
64. Camacho, J., Guimerà, R., and Amaral, L. A. N., 2002. Robust patterns in food web structure. Phys. Rev. Lett. 88, 228102.
65. Capocci, A., Servedio,V. D. P., Caldarelli, G., and Colaiori, F., 2004. Detecting communities in large networks. In S. Leonardi (ed.), Proceedings of the 3rd Workshop on Algorithms and Models for the Web Graph, no. 3243 in Lecture Notes in Computer Science. Springer, Berlin.
66. Carlson, J. M. and Doyle, J., 1999. Highly optimized tolerance: A mechanism for power laws in designed systems. Phys. Rev. E 60, 1412-1427.
67. Carlson, J. M. and Doyle, J., 2000. Highly optimized tolerance: Robustness and design in complex systems. Phys. Rev. Lett. 84, 2529-2532.
68. Chakrabarti, S., Dom, B., Gibson, D., Kleinberg, J. M., Raghavan, P., and Rajagopalan, S., 1998a. Automatic resource list compilation by analyzing hyperlink structure and associated text. Computer Networks 30, 65-74.
69. Chakrabarti, S., Dom, B., Gibson, D., Kumar, S., Raghavan, P., Rajagopalan, S., andTomkins, A., 1998b. Experiments in topic distillation. In ACM SIGIR Workshop on Hypertext Information Retrieval on the Web. Association of Computing Machinery, New York.
70. Chen, Q., Chang, H., Govindan, R., Jamin, S., Shenker, S. J., and Willinger, W., 2002. The origin of power laws in Internet topologies revisited. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE Computer Society.
71. Chung, F. and Lu, L., 2002a. The average distances in random graphs with given expected degrees. Proc. Natl. Acad. Sci. USA 99, 15879-15882.
72. Chung, F. and Lu, L., 2002b. Connected components in random graphs with given degree sequences. Annals of Combinatorics 6, 125-145.
73. Chung, F., Lu, L., Dewey, T. G., and Galas, D. J., 2003. Duplication models for biological networks. Journal of Computational Biology 10, 677-688.
74. Cohen, R. and Havlin, S., 2003. Scale-free networks are ultrasmall. Phys. Rev. Lett. 90, 058701.
75. Cohen, R., Erez, K., ben-Avraham, D., and Havlin, S., 2000. Resilience of the Internet to random breakdowns. Phys. Rev. Lett. 85, 4626-4628.
76. Cohen, R., Erez, K., ben-Avraham, D., and Havlin, S., 2001. Breakdown of the Internet under intentional attack. Phys. Rev. Lett. 86, 3682-3685.
77. Collet, P. and Eckmann, J.-P., 2002. The number of large graphs with a positive density of triangles. J. Stat. Phys. 109, 923-943.
78. Cooke, K. L., Calef, D. F., and Level, E. V., 1977. Stability or chaos in discrete epidemic models. In Nonlinear Systems and Applications: An International Conference, pp. 73-93. Academic Press, New York.
79. Costa, L. D., 2004. Reinforcing the resilience of complex networks. Phys. Rev. E 69, 066127.
80. Crisanti, A., Paladin, G., and Vulpiani, A., 1993. Products of Random Matrices in Statistical Physics. Springer, Berlin.
81. Csányi, G. and Szendro{double acute accent}i, B., 2004. Structure of a large social network. Phys. Rev. E 69, 036131.
82. Davidsen, J., Ebel, H., and Bornholdt, S., 2002. Emergence of a small world from local interactions:Modeling acquaintance networks. Phys. Rev. Lett. 88, 128701.
83. de Castro, R. and Grossman, J.W., 1999. Famous trails to Paul Erdo{double acute accent}s. Mathematical Intelligencer 21, 51-63.
84. de Menezes, M.A., Moukarzel, C., and Penna, T. J. P., 2000. First-order transition in small-world networks. Europhys. Lett. 50, 574-579.
85. de Moura, A. P. S., Lai,Y.-C., and Motter, A. E., 2003. Signatures of small-world and scale-free properties in large computer programs. Phys. Rev. E 68, 017102.
86. Degenne, A. and Forsé, M., 1999. Introducing Social Networks. Sage, London.
87. Ding, Y., Foo, S., and Chowdhury, G., 1999. A bibliometric analysis of collaboration in the field of information retrieval. Intl. Inform. and Libr. Rev. 30, 367-376.
88. Dodds, P. S., Muhamad, R., and Watts, D. J., 2003. An experimental study of search in global social networks. Science 301, 827-829.
89. Dorogovtsev, S. N. and Mendes, J. F. F., 2000a. Evolution of networks with aging of sites. Phys. Rev. E 62, 1842-1845.
90. Dorogovtsev, S. N. and Mendes, J. F. F., 2000b. Exactly solvable small-world network. Europhys. Lett. 50, 1-7.
91. Dorogovtsev, S. N. and Mendes, J. F. F., 2003. Evolution of Networks: From Biological Nets to the Internet and WWW. Oxford University Press, Oxford.
92. Dorogovtsev, S. N., Mendes, J. F. F., and Samukhin, A. N., 2000. Structure of growing networks with preferential linking. Phys. Rev. Lett. 85, 4633-4636.
93. Dorogovtsev, S. N., Mendes, J. F. F., and Samukhin, A. N., 2001a. Giant strongly connected component of directed networks. Phys. Rev. E 64, 025101.
94. Dorogovtsev, S. N., Mendes, J. F. F., and Samukhin, A. N., 2001b. Size-dependent degree distribution of a scale-free growing network. Phys. Rev. E 63, 062101.
95. Dorogovtsev, S. N., Goltsev, A. V., and Mendes, J. F. F., 2002. Pseudofractal scale-free web. Phys. Rev. E 65, 066122.
96. Doye, J. P. K., 2002. Network topology of a potential energy landscape: Astatic scale-free network. Phys. Rev. Lett. 88, 238701.
97. Ebel, H., Mielsch, L.-I., and Bornholdt, S., 2002. Scale-free topology of e-mail networks. Phys. Rev. E 66, 035103.
98. Eckmann, J.-P. and Moses, E., 2002. Curvature of co-links uncovers hidden thematic layers in the world wide web. Proc. Natl. Acad. Sci. USA 99, 5825-5829.
99. Egghe, L. and Rousseau, R., 1990. Introduction to Informetrics. Elsevier, Amsterdam.
100. Eguiluz, V. M., Chialvo, D. R., Cecchi, G., Baliki, M., and Apkarian, A. V., 2005. Scale-free brain functional networks. Phys. Rev. Lett. 94, 018102.
101. Eisenberg, E. and Levanon, E.Y., 2003. Preferential attachment in the protein network evolution. Phys. Rev. Lett. 91, 138701.
102. Erdo{double acute accent}s, P. and Rényi, A., 1959. On random graphs. Publicationes Mathematicae 6, 290-297.
103. Erdo{double acute accent}s, P. and Rényi, A., 1960. On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences 5, 17-61.
104. Erdo{double acute accent}s, P. and Rényi, A., 1961. On the strength of connectedness of a random graph. Acta Mathematica Scientia Hungary 12, 261-267.
105. Ergün, G. and Rodgers, G. J., 2002. Growing random networks with fitness. Physica A 303, 261-272.
106. Faloutsos, M., Faloutsos, P., and Faloutsos, C., 1999. On power-law relationships of the internet topology. Computer Communications Review 29, 251-262.
107. Farkas, I. J., Derényi, I., Barabási, A.-L., and Vicsek, T., 2001. Spectra of "real-world" graphs:Beyond the semicircle law. Phys. Rev. E 64, 026704.
108. Farkas, I. J., Jeong, H.,Vicsek, T., Barabási, A.-L., and Oltvai, Z. N., 2003. The topology of the transcription regulatory network in the yeast, Saccharomyces cerevisiae. Physica A 381, 601-612.
109. Featherstone, D. E. and Broadie, K., 2002. Wrestling with pleiotropy: Genomic and topological analysis of the yeast gene expression network. Bioessays 24, 267-274.
110. Fell, D. A. and Wagner, A., 2000. The small world of metabolism. Nature Biotechnology 18, 1121-1122.
111. Ferrer i Cancho, R. and Solé, R. V., 2001. The small world of human language. Proc. R. Soc. London B 268, 2261-2265.
112. Ferrer i Cancho, R. and Solé, R. V., 2003. Optimization in complex networks. In R. Pastor-Satorras, J. Rubi, and A. Díaz-Guilera (eds.), Statistical Mechanics of Complex Networks, no. 625 in Lecture Notes in Physics, pp. 114-125. Springer, Berlin.
113. Fiedler, M., 1973. Algebraic connectivity of graphs. Czech. Math. J. 23, 298-305.
114. Flake, G. W., Lawrence, S. R., Giles, C. L., and Coetzee, F. M., 2002. Self-organization and identification ofWeb communities. IEEE Computer 35, 66-71.
115. Ford, G. W. and Uhlenbeck, G. E., 1957. Combinatorial problems in the theory of graphs. IV. Proc. Natl. Acad. Sci. USA 43, 163-167.
116. Fortunato, S., Latora, V., and Marchiori, M., 2004. A method to find community structures based on information centrality. Phys. Rev. E 70, 056104.
117. Freeman, L. C., 1977. A set of measures of centrality based upon betweenness. Sociometry 40, 35-41.
118. Fronczak, A., Fronczak, P., and Holyst, J. A., 2002a. Exact solution for average path length in random graphs. Preprint cond-mat/0212230.
119. Fronczak, A., Holyst, J. A., Jedynak, M., and Sienkiewicz, J., 2002b. Higher order clustering coefficients in Barabasi-Albert networks. Physica A 316, 688-694.
120. Gibson, D., Kleinberg, J., and Raghavan, P., 1998. Inferring web communities from link topology. In Proceedings of the 9th ACM Conference on Hypertext and Hypermedia. Association of Computing Machinery, New York.
121. Gilbert, E. N., 1959. Random graphs. Annals of Mathematical Statistics 30, 1191-1141.
122. Giot, L., Bader, J. S., Brouwer, C., et al., 2003. A protein interaction map of Drosophila melanogaster. Science 302, 1727-1736.
123. Girvan, M. and Newman, M. E. J., 2002. Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821-7826.
124. Girvan, M., Callaway, D. S., Newman, M. E. J., and Strogatz, S. H., 2002. A simple model of epidemics with pathogen mutation. Phys. Rev. E 65, 031915.
125. Gladwell, M., 2000. The Tipping Point: How Little Things Can Make a Big Difference. Little Brown, New York.
126. Gleiser, P. and Danon, L., 2003. Community structure in jazz. Advances in Complex Systems 6, 565-573.
127. Gleiss, P. M., Stadler, P. F., Wagner, A., and Fell, D. A., 2001. Relevant cycles in chemical reaction networks. Advances in Complex Systems 4, 207-226.
128. Goh, K.-I., Kahng, B., and Kim, D., 2001a. Spectra and eigenvectors of scale-free networks. Phys. Rev. E 64, 051903.
129. Goh, K.-I., Kahng, B., and Kim, D., 2001b. Universal behavior of load distribution in scale-free networks. Phys. Rev. Lett. 87, 278701.
130. Goh, K.-I., Oh, E., Jeong, H., Kahng, B., and Kim, D., 2002. Classification of scale-free networks. Proc. Natl. Acad. Sci. USA 99, 12583-12588.
131. Goh, K.-I., Ghim, C.-M., Kahng, B., and Kim, D., 2003. Comment on 'Universal behavior of load distribution in scale-free networks'. Phys. Rev. Lett. 91, 189804.
132. Govindan, R. and Tangmunarunkit, H., 2000. Heuristics for Internet map discovery. In Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 1371-1380. Institute of Electrical and Electronics Engineers, New York.
133. Granovetter, M., 1995. Getting a Job: A Study in Contacts and Careers. University of Chicago Press, Chicago.
134. Grossman, J.W., 2002. The evolution of the mathematical research collaboration graph. Congressus Numerantium 158, 202-212.
135. Grossman, J. W. and Ion, P. D. F., 1995. On a portion of the well-known collaboration graph. Congressus Numerantium 108, 129-131.
136. Guardiola, X., Guimerà, R., Arenas, A., Diaz-Guilera, A., Streib, D., and Amaral, L. A. N., 2002. Macro-and micro-structure of trust networks. Preprint cond-mat/0206240.
137. Guhr, T., Müller-Groeling, A., and Weidenmüller, H. A., 1998. Random-matrix theories in quantum physics: Common concepts. Phys. Rep. 299, 189-425.
138. Guimerà, R. and Amaral, L. A. N., 2003. Modelling the world-wide airport network. Eur. Phys. J. B 38, 381-385.
139. Guimerà, R., Danon, L., Díaz-Guilera, A., Giralt, F., and Arenas, A., 2003. Self-similar community structure in organisations. Phys. Rev. E 68, 065103.
140. Hammersley, J. M., 1957. Percolation processes: II. The connective constant. Proc. Cambridge Philos. Soc. 53, 642-645.
141. Harary, F., 1995. Graph Theory. Perseus, Cambridge, MA.
142. Hartwell, L. H., Hopfield, J. J., Leibler, S., and Murray, A. W., 1999. From molecular to modular cell biology. Nature 402, C47-52.
143. Herrero, C. P., 2002. Ising model in small-world networks. Phys. Rev. E 65, 066110.
144. Hethcote, H.W., 2000. The mathematics of infectious diseases. SIAM Review 42, 599-653.
145. Holland, P. W. and Leinhardt, S., 1981. An exponential family of probability distributions for directed graphs. J. Amer. Stat. Assoc. 76, 33-50.
146. Holme, P. and Huss, M., 2003. Discovery and analysis of biochemical subnetwork hierarchies. In R. Gauges, U. Kummer, J. Pahle, and U. Rost (eds.), Proceedings of the 3rd Workshop on Computation of Biochemical Pathways and Genetic Networks, pp. 3-9. Logos, Berlin.
147. Holme, P., Huss, M., and Jeong, H., 2003. Subnetwork hierarchies of biochemical pathways. Bioinformatics 19, 532-538.
148. Holme, P., Edling, C. R., and Liljeros, F., 2004. Structure and time-evolution of an Internet dating community. Social Networks 26, 155-174.
149. Hong, H., Kim, B. J., and Choi, M.Y., 2002. Comment on 'Ising model on a small world network'. Phys. Rev. E 66, 018101.
150. Huberman, B. A. and Adamic, L. A., 1999. Growth dynamics of theWorld-WideWeb. Nature 401, 131.
151. Hughes, D. and Paczuski, M., 2003. Scale-free magnetic networks: Comparing observational data with a self-organizing model of the coronal field. Preprint astro-ph/0309230.
152. Ito, T., Tashiro, K., Muta, S., Ozawa, R., Chiba, T., Nishizawa, M., Yamamoto, K., Kuhara, S., and Sakaki, Y., 2000. Toward a protein-protein interaction map of the budding yeast: A comprehensive system to examine two-hybrid interactions in all possible combinations between the yeast proteins. Proc. Natl. Acad. Sci. USA 97, 1143-1147.
153. Ito, T., Chiba, T., Ozawa, R.,Yoshida, M., Hattori, M., and Sakaki,Y., 2001. A comprehensive two-hybrid analysis to explore the yeast protein interactome. Proc. Natl. Acad. Sci. USA 98, 4569-4574.
154. Jacobs, J., 1961. The Death and Life of Great American Cities. Random House, New York.
155. Jain, S. and Krishna, S., 1998. Autocatalytic sets and the growth of complexity in an evolutionary model. Phys. Rev. Lett. 81, 5684-5687.
156. Janson, S., Łuczak, T., and Rucinski, A., 1999. Random Graphs. John Wiley, New York.
157. Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N., and Barabási, A.-L., 2000. The large-scale organization of metabolic networks. Nature 407, 651-654.
158. Jeong, H., Mason, S., Barabási, A.-L., and Oltvai, Z. N., 2001. Lethality and centrality in protein networks. Nature 411, 41-42.
159. Jeong, H., Néda, Z., and Barabási, A.-L., 2003. Measuring preferential attachment in evolving networks. Europhys. Lett. 61, 567-572.
160. Jin, E. M., Girvan, M., and Newman, M. E. J., 2001. The structure of growing social networks. Phys. Rev. E 64, 046132.
161. Jones, J. H. and Handcock, M. S., 2003a. An assessment of preferential attachment as a mechanism for human sexual network formation. Proc. R. Soc. London B 270, 1123-1128.
162. Jones, J. H. and Handcock, M. S., 2003b. Sexual contacts and epidemic thresholds. Nature 423, 605-606.
163. Karinthy, F., 1929. Chains. In Everything is Different. Budapest.
164. Kautz, H., Selman, B., and Shah, M., 1997. ReferralWeb: Combining social networks and collaborative filtering. Comm. ACM 40, 63-65.
165. Keeling, M. J., 1999. The effects of local spatial structure on epidemiological invasion. Proc. R. Soc. London B 266, 859-867.
166. Kim, J., Krapivsky, P. L., Kahng, B., and Redner, S., 2002. Infinite-order percolation and giant fluctuations in a protein interaction network. Phys. Rev. E 66, 055101.
167. Kleinberg, J. M., 1999. Authoritative sources in a hyperlinked environment. J. ACM 46, 604-632.
168. Kleinberg, J. M., 2000a. Navigation in a small world. Nature 406, 845.
169. Kleinberg, J. M., 2000b. The small-world phenomenon: An algorithmic perspective. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 163-170. Association of Computing Machinery, New York.
170. Kleinberg, J. M., 2002. Small world phenomena and the dynamics of information. In T.G. Dietterich, S. Becker, and Z. Ghahramani (eds.), Proceedings of the 2001 Neural Information Processing Systems Conference. MIT Press, Cambridge, MA.
171. Kleinberg, J. M.,Kumar, S. R., Raghavan, P., Rajagopalan, S., andTomkins, A., 1999. TheWeb as a graph: Measurements, models and methods. In Proceedings of the International Conference on Combinatorics and Computing, no. 1627 in Lecture Notes in Computer Science, pp. 1-18. Springer, Berlin.
172. Klemm, K. and Eguiluz, V. M., 2002. Highly clustered scale-free networks. Phys. Rev. E 65, 036123.
173. Krapivsky, P. L. and Redner, S., 2001. Organization of growing random networks. Phys. Rev. E 63, 066123.
174. Krapivsky, P. L., Redner, S., and Leyvraz, F., 2000. Connectivity of growing random networks. Phys. Rev. Lett. 85, 4629-4632.
175. Krebs, V. E., 2002. Mapping networks of terrorist cells. Connections 24, 43-52.
176. Kretschmer, H., 1994. Coauthorship networks of invisible college and institutionalized communities. Scientometrics 30, 363-369.
177. Kretzschmar, M. and Morris, M., 1996. Measures of concurrency in networks and the spread of infectious disease. Math. Biosci. 133, 165-195.
178. Kulkarni, R. V., Almaas, E., and Stroud, D., 2000. Exact results and scaling properties of small-world networks. Phys. Rev. E 61, 4268-4271.
179. Kullmann, L. and Kertesz, J., 2001. Preferential growth: Exact solution of the time-dependent distributions. Phys. Rev. E 63, 051112.
180. Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D.,Tomkins,A. S., and Upfal, E., 2000a. Stochastic models for theWeb graph. In Proceedings of the 42st Annual IEEE Symposium on the Foundations of Computer Science, pp. 57-65. Institute of Electrical and Electronics Engineers, New York.
181. Kumar, R., Raghavan, P., Rajalopagan, S., Suvakumar, D., Tomkins, A. S., and Upfal, E., 2000b. The web as a graph. In Proceeedings of the 19th ACM Symposium on Principles of Database Systems, pp. 1-10. Association of Computing Machinery, New York.
182. Kuperman, M. and Abramson, G., 2001. Small world effect in an epidemiological model. Phys. Rev. Lett. 86, 2909-2912.
183. Kuperman, M. and Zanette, D. H., 2002. Stochastic resonance in a model of opinion formation on small world networks. Eur. Phys. J. B 26, 387-391.
184. Laumann, E. O., Gagnon, J. H., Michael, R. T., and Michaels, S., 1994. The Social Organization of Sexuality: Sexual Practices in the United States. University of Chicago Press, Chicago.
185. Lawrence, S. and Giles, C. L., 1998. Searching the world wide web. Science 280, 98-100.
186. Lawrence, S. and Giles, C. L., 1999. Accessibility of information on the web. Nature 400, 107-109.
187. Lehmann, S., Lautrup, B., and Jackson, A. D., 2003. Citation networks in high energy physics. Phys. Rev. E 68, 026113.
188. Li, L., Alderson, D., Willinger, W., and Doyle, J., 2004a. A first principles approach to understanding the internet's router-level topology. Computer Communications Review 34, 3-14.
189. Li, S., Armstrong, C. M., Bertin, N., et al., 2004b. A map of the interactome network of the metazoan C. elegans. Science 303, 540-543.
190. Liljeros, F., Edling, C. R., Amaral, L. A. N., Stanley, H. E., and Åberg,Y., 2001. The web of human sexual contacts. Nature 411, 907-908.
191. Lloyd, A. L. and May, R. M., 2001. How viruses spread among computers and people. Science 292, 1316-1317.
192. Longini, I. M., 1988. A mathematical model for predicting the geographic spread of new infectious agents. Math. Biosci. 90, 367-383.
193. Łuczak, T., 1992. Sparse random graphs with a given degree sequence. In A. M. Frieze and T. Łuczak (eds.), Proceedings of the Symposium on Random Graphs, Poznań 1989, pp. 165-182. John Wiley, New York.
194. Lynch, N. A., 1996. Distributed Algorithms. Morgan Kauffman, San Francisco, CA.
195. MacCluer, C. R., 2000. The many proofs and applications of Perron's theorem. SIAM Rev. 42, 487-498.
196. Maslov, S. and Sneppen, K., 2002. Specificity and stability in topology of protein networks. Science 296, 910-913.
197. Maslov, S., Sneppen, K., and Zaliznyak, A., 2004. Detection of topological patterns in complex networks: Correlation profile of the internet. Physica A 333, 529-540.
198. Medina, A., Matta, I., and Byers, J., 2000. On the origin of power laws in Internet topologies. Computer Communications Review 30, 18-28.
199. Mehta, M. L., 1991. Random Matrices. Academic Press, New York, 2nd ed.
200. Melin, G. and Persson, O., 1996. Studying research collaboration using co-authorships. Scientometrics 36, 363-377.
201. Menger, K., 1927. Zur allgemeinen Kurventheorie. Fundamenta Mathematicae 10, 96-115.
202. Merton, R. K., 1968. The Matthew effect in science. Science 159, 56-63.
203. Milgram, S., 1967. The small world problem. Psychology Today 2, 60-67.
204. Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., and Alon, U., 2002. Network motifs: Simple building blocks of complex networks. Science 298, 824-827.
205. Mollison, D., 1977. Spatial contact models for ecological and epidemic spread. Journal of the Royal Statistical Society B 39, 283-326.
206. Molloy, M. and Reed, B., 1995. A critical point for random graphs with a given degree sequence. Random Structures and Algorithms 6, 161-179.
207. Molloy, M. and Reed, B., 1998. The size of the giant component of a random graph with a given degree sequence. Combinatorics, Probability and Computing 7, 295-305.
208. Monasson, R., 1999. Diffusion, localization and dispersion relations on 'small-world' lattices. Eur. Phys. J. B 12, 555-567.
209. Montoya, J. M. and Solé, R. V., 2002. Small world patterns in food webs. J. Theor. Bio. 214, 405-412.
210. Montoya, J. M. and Solé, R. V., 2003. Topological properties of food webs: From real data to community assembly models. Oikos 102, 614-622.
211. Moody, J., 2001. Race, school integration, and friendship segregation in America. Am. J. Sociol. 107, 679-716.
212. Moore, C. and Newman, M. E. J., 2000a. Epidemics and percolation in small-world networks. Phys. Rev. E 61, 5678-5682.
213. Moore, C. and Newman, M. E. J., 2000b. Exact solution of site and bond percolation on small-world networks. Phys. Rev. E 62, 7059-7064.
214. Moreira, A. A., Andrade, Jr., J. S., and Amaral, L. A. N., 2002. Extremum statistics in scale-free network models. Phys. Rev. Lett. 89, 268703.
215. Morris, M., 1993. Telling tails explain the discrepancy in sexual partner reports. Nature 365, 437-440.
216. Morris, M., 1995. Data driven network models for the spread of infectious disease. In D. Mollison (ed.), Epidemic Models: Their Structure and Relation to Data, pp. 302-322. Cambridge University Press, Cambridge.
217. Moukarzel, C. F., 1999. Spreading and shortest paths in systems with sparse long-range connections. Phys. Rev. E 60, 6263-6266.
218. Nagurney, A., 1993. Network Economics: A Variational Inequality Approach. Kluwer Academic Publishers, Dordrecht.
219. Newman, M. E. J., 2001a. The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. USA 98, 404-409.
220. Newman, M. E. J., 2001b. Scientific collaboration networks: I. Network construction and fundamental results. Phys. Rev. E 64, 016131.
221. Newman, M. E. J., 2001c. Scientific collaboration networks: II. Shortest paths, weighted networks, and centrality. Phys. Rev. E 64, 016132.
222. Newman, M. E. J., 2001d. Clustering and preferential attachment in growing networks. Phys. Rev. E 64, 025102.
223. Newman, M. E. J., 2002a. Assortative mixing in networks. Phys. Rev. Lett. 89, 208701.
224. Newman, M. E. J., 2002b. Spread of epidemic disease on networks. Phys. Rev. E 66, 016128.
225. Newman, M.E. J., 2002c. The structure and function of networks. Computer Physics Communications 147, 40-45.
226. Newman, M. E. J., 2003a. Ego-centered networks and the ripple effect. Social Networks 25, 83-95.
227. Newman, M. E. J., 2003b. Mixing patterns in networks. Phys. Rev. E 67, 026126.
228. Newman, M. E. J., 2003c. Properties of highly clustered networks. Phys. Rev. E 68, 026121.
229. Newman, M. E. J., 2004a. Coauthorship networks and patterns of scientific collaboration. Proc. Natl. Acad. Sci. USA 101, 5200-5205.
230. Newman, M. E. J., 2004b. Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066133.
231. Newman, M. E. J. and Girvan, M., 2004. Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113.
232. Newman, M. E. J. and Park, J., 2003. Why social networks are different from other types of networks. Phys. Rev. E 68, 036122.
233. Newman, M. E. J. and Watts, D. J., 1999a. Renormalization group analysis of the small-world network model. Phys. Lett. A 263, 341-346.
234. Newman, M. E. J. and Watts, D. J., 1999b. Scaling and percolation in the small-world network model. Phys. Rev. E 60, 7332-7342.
235. Newman, M. E. J., Moore, C., and Watts, D. J., 2000. Mean-field solution of the small-world network model. Phys. Rev. Lett. 84, 3201-3204.
236. Newman, M. E. J., Strogatz, S. H., andWatts, D. J., 2001. Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118.
237. Newman, M. E. J., Forrest, S., and Balthrop, J., 2002a. Email networks and the spread of computer viruses. Phys. Rev. E 66, 035101.
238. Newman, M. E. J., Jensen, I., and Ziff, R. M., 2002b. Percolation and epidemics in a twodimensional small world. Phys. Rev. E 65, 021904.
239. Newman, M. E. J., Watts, D. J., and Strogatz, S. H., 2002c. Random graph models of social networks. Proc. Natl. Acad. Sci. USA 99, 2566-2572.
240. Ohno, S., 1970. Evolution by Gene Duplication. Springer, New York.
241. Overbeek, R., Larsen, N., Pusch, G. D., D'Souza, M., Selkov, Jr., E., Kyrpides, N., Fonstein, M., Maltsev, N., and Selkov, E., 2000. Wit: Integrated system for high-throughput genome sequence analysis and metabolic reconstruction. Nucleic Acids Res. 28, 123-125.
242. Ozana, M., 2001. Incipient spanning cluster on small-world networks. Europhys. Lett. 55, 762-766.
243. Palla, G., Derenyi, I., Farkas, I., and Vicsek, T., 2005. Uncovering the overlapping community structure of complex networks in nature and science. Nature 435, 814-818.
244. Pandit, S. A. and Amritkar, R. E., 2001. Random spread on the family of small-world networks. Phys. Rev. E 63, 041104.
245. Park, J. and Newman, M. E. J., 2003. The origin of degree correlations in the Internet and other networks. Phys. Rev. E 68, 026112.
246. Park, J., Lappe, M., and Teichmann, S. A., 2001. Mapping protein family interactions: Intramolecular and intermolecular protein family interaction repertoires in the PDB and yeast. J. Mol. Biol. 307, 929-938.
247. Pastor-Satorras, R. and Vespignani, A., 2001. Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86, 3200-3203.
248. Pastor-Satorras, R. andVespignani, A., 2004. Evolution and Structure of the Internet. Cambridge University Press, Cambridge.
249. Pastor-Satorras, R., Vázquez, A., and Vespignani, A., 2001. Dynamical and correlation properties of the Internet. Phys. Rev. Lett. 87, 258701.
250. Pȩkalski, A., 2001. Ising model on a small world network. Phys. Rev. E 64, 057104.
251. Pennock, D. M., Flake, G. W., Lawrence, S., Glover, E. J., and Giles, C. L., 2002. Winners don't take all: Characterizing the competition for links on the web. Proc. Natl. Acad. Sci. USA 99, 5207-5211.
252. Persson, O. and Beckmann, M., 1995. Locating the network of interacting authors in scientific specialties. Scientometrics 33, 351-366.
253. Plischke, M.andBergersen, B., 1994. Equilibrium Statistical Physics.World Scientific, Singapore, 2nd ed.
254. Pool, I. de S. and Kochen, M., 1978. Contacts and influence. Social Networks 1, 1-48.
255. Pothen, A., Simon, H., and Liou, K.-P., 1990. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11, 430-452.
256. Potterat, J. J., Phillips-Plummer, L., Muth, S. Q., Rothenberg, R. B., Woodhouse, D. E., Maldonado-Long, T. S., Zimmerman, H. P., and Muth, J. B., 2002. Risk network structure in the early epidemic phase of HIV transmission in Colorado Springs. Sexually Transmitted Infections 78, i159-i163.
257. Price, D. J. de S., 1965. Networks of scientific papers. Science 149, 510-515.
258. Price, D. J. de S., 1976. Ageneral theory of bibliometric and other cumulative advantage processes. J. Amer. Soc. Inform. Sci. 27, 292-306.
259. Provero, P., 2002. Gene networks from DNA microarray data: Centrality and lethality. Preprint cond-mat/0207345.
260. Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., and Parisi, D., 2004. Defining and identifying communities in networks. Proc. Natl. Acad. Sci. USA 101, 2658-2663.
261. Rapoport, A., 1957. Contribution to the theory of random and biased nets. Bulletin of Mathematical Biophysics 19, 257-277.
262. Rapoport, A., 1963. Mathematical models of social interaction. In R. D. Luce, R. R. Bush, and E. Galanter (eds.), Handbook of Mathematical Psychology, vol. 2, pp. 493-579.Wiley, NewYork.
263. Rapoport, A. and Horvath, W. J., 1961. A study of a large sociogram. Behavioral Science 6, 279-291.
264. Ravasz, E. and Barabási, A.-L., 2003. Hierarchical organization in complex networks. Phys. Rev. E 67, 026112.
265. Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z., and Barabási, A.-L., 2002. Hierarchical organization of modularity in metabolic networks. Science 297, 1551-1555.
266. Redner, S., 1998. How popular is your paper? An empirical study of the citation distribution. Eur. Phys. J. B 4, 131-134.
267. Reichardt, J. and Bornholdt, S., 2004. Detecting fuzzy community structures in complex networks with a q-state Potts model. Preprint cond-mat/0402349.
268. Ritter, J. P., 2000. Why Gnutella can't scale. No, really. URL http://www.darkridge.com/~jpr5/doc/gnutella.html.
269. Rozenfeld, H. D. and ben-Avraham, D., 2004. Designer nets from local strategies. Phys. Rev. E 70, 056107.
270. Sánchez, A. D., López, J. M., and Rodríguez, M. A., 2002. Nonequilibrium phase transitions in directed small-world networks. Phys. Rev. Lett. 88, 048701.
271. Sander, L. M., Warren, C. P., Sokolov, I., Simon, C., and Koopman, J., 2002. Percolation on disordered networks as a model for epidemics. Math. Biosci. 180, 293-305.
272. Sattenspiel, L. and Simon, C. P., 1988. The spread and persistence of infectious diseases in structured populations. Math. Biosci. 90, 341-366.
273. Schneeberger, A., Mercer, C. H., Gregson, S. A. J., Ferguson, N. M., Nyamukapa, C. A., Anderson, R. M., Johnson, A. M., and Garnett, G. P., 2004. Scale-free networks and sexually transmitted diseases-A description of observed patterns of sexual contacts in Britain and Zimbabwe. Sexually Transmitted Diseases 31, 380-387.
274. Schwartz, N., Cohen, R., ben-Avraham, D., Barabási, A.-L., and Havlin, S., 2002. Percolation in directed scale-free networks. Phys. Rev. E 66, 015104.
275. Scott, J., 2000. Social Network Analysis: A Handbook. Sage, London, 2nd ed.
276. Searls, D. B., 2003. Data integration-connecting the dots. Nature Biotechnology 21, 844-845.
277. Seglen, P. O., 1992. The skewness of science. J. Amer. Soc. Inform. Sci. 43, 628-638.
278. Serrano, M. A. and Boguñá, M., 2003. Topology of the world trade web. Phys. Rev. E 68, 015101.
279. Sethna, J. P., Dahmen, K., Kartha, S., Krumhansl, J. A., Roberts, B. W., and Shore, J. D., 1993. Hysteresis and hierarchies: Dynamics of disorder-driven first-order phase transformations. Phys. Rev. Lett. 70, 3347-3350.
280. Shaw, S., 2003. Evidence of scale-free topology and dynamics in gene regulatory networks. In Proceedings of the ISCA 12th International Conference on Intelligent and Adaptive Systems and Software Engineering, pp. 37-40.
281. Simmel, G., 1950. The Sociology of Georg Simmel. Free Press, New York.
282. Simon, H. A., 1955. On a class of skew distribution functions. Biometrika 42, 425-440.
283. Smith, R. D., 2002. Instant messaging as a scale-free network. Preprint cond-mat/0206378.
284. Solé, R. V. and Montoya, J. M., 2001. Complexity and fragility in ecological networks. Proc. R. Soc. London B 268, 2039-2045.
285. Solé, R. V., Pastor-Satorras, R., Smith, E., and Kepler, T. B., 2002. A model of large-scale proteome evolution. Advances in Complex Systems 5, 43-54.
286. Solomonoff, R. and Rapoport, A., 1951. Connectivity of random nets. Bulletin of Mathematical Biophysics 13, 107-117.
287. Spencer, M., 2002. Rapoport at ninety. Connections 24, 104-107.
288. Stanley, H. E., 1971. Introduction to Phase Transitions and Critical Phenomena. Oxford University Press, Oxford.
289. Stauffer, D. and Aharony, A., 1992. Introduction to Percolation Theory. Taylor and Francis, London, 2nd ed.
290. Strauss, D., 1986. On a general class of models for interaction. SIAM Review 28, 513-527.
291. Strogatz, S. H., 1994. Nonlinear Dynamics and Chaos. Addison-Wesley, Reading, MA.
292. Tanizawa, T., Paul, G., Cohen, R., Havlin, S. and Stanley, H. E., 2005. Optimization of network robustness to waves of targeted and random attacks. Phys. Rev. E 71, 047101.
293. Travers, J. and Milgram, S., 1969. An experimental study of the small world problem. Sociometry 32, 425-443.
294. Tsallis, C. and de Albuquerque, M. P., 1999. Are citations of scientific papers a case of nonextensivity? Eur. Phys. J. B 13, 777-780.
295. Tyler, J. R., Wilkinson, D. M., and Huberman, B. A., 2003. Email as spectroscopy: Automated discovery of community structure within organizations. In M. Huysman, E. Wenger, and V. Wulf (eds.), Proceedings of the First International Conference on Communities and Technologies. Kluwer, Dordrecht.
296. Uetz, P., Giot, L., Cagney, G., Mansfield, T. A., Judson, R. S., Knight, J. R., Lockshon, D., Narayan, V., Srinivasan, M., Pochart, P., Qureshi-Emili, A., Li, Y., Godwin, B., Conover, D., Kalbfleisch, T.,Vijayadamodar, G.,Yang, M., Johnston, M., Fields, S., and Rothberg, J. M., 2000. A comprehensive analysis of protein-protein interactions in saccharomyces cerevisiae. Nature 403, 623-627.
297. Valverde, S. and Solé, R. V., 2002. Self-organized critical traffic in parallel computer networks. Physica A 312, 636-648.
298. Vázquez, A., 2001. Statistics of citation networks. Preprint cond-mat/0105031.
299. Vázquez,A., 2002. Growing networks with local rules: Preferential attachment, clustering hierarchy and degree correlations. Phys. Rev. E 67, 056104.
300. Vázquez, A., Pastor-Satorras, R., and Vespignani, A., 2002. Large-scale topological and dynamical properties of the Internet. Phys. Rev. E 65, 066130.
301. Vázquez, A., Flammini, A., Maritan, A., andVespignani, A., 2003. Modeling of protein interaction networks. Complexus 1, 38-44.
302. Viana Lopes, J., Pogorelov, Y. G., Lopes dos Santos, J. M. B., and Toral, R., 2004. Exact solution of Ising model on a small-world network. Phys. Rev. E 70, 026112.
303. Wagner, A., 2001. The yeast protein interaction network evolves rapidly and contains few redundant duplicate genes. Mol. Biol. Evol. 18, 1283-1292.
304. Wagner, A. and Fell, D., 2001. The small world inside large metabolic networks. Proc. R. Soc. London B 268, 1803-1810.
305. Walsh, T., 1999. Search in a small world. In T. Dean (ed.), Proceedings of the 16th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, San Francisco, CA.
306. Wasserman, S. and Faust, K., 1994. Social Network Analysis. Cambridge University Press, Cambridge.
307. Watts, D. J., 1999. Small Worlds. Princeton University Press, Princeton.
308. Watts, D. J., 2002. A simple model of global cascades on random networks. Proc. Natl. Acad. Sci. USA 99, 5766-5771.
309. Watts, D. J., 2003. Six Degrees: The Science of a Connected Age. Norton, New York.
310. Watts, D. J. and Strogatz, S. H., 1998. Collective dynamics of 'small-world' networks. Nature 393, 440-442.
311. Watts, D. J., Dodds, P. S., and Newman, M. E. J., 2002. Identity and search in social networks. Science 296, 1302-1305.
312. West, D. B., 1996. Introduction to Graph Theory. Prentice Hall, Upper Saddle River, NJ.
313. White, H. C., 1970. Search parameters for the small world problem. Social Forces 49, 259-264.
314. White, J. G., Southgate, E., Thompson, J. N., and Brenner, S., 1986. The structure of the nervous system of the nematode C. Elegans. Phil. Trans. R. Soc. London 314, 1-340.
315. Wigner, E. P., 1955. Characteristic vectors of bordered matrices with infinite dimensions. Ann. Math. 62, 548-564.
316. Wigner, E. P., 1957. Characteristic vectors of bordered matrices with infinite dimensions II. Ann. Math. 65, 203-207.
317. Wigner, E. P., 1958. On the distributions of the roots of certain symmetric matrices. Ann. Math. 67, 325-327.
318. Wilf, H., 1994. Generatingfunctionology. Academic Press, London, 2nd ed.
319. Wilkinson, D. M. and Huberman, B. A., 2004. Amethod for finding communities of related genes. Proc. Natl. Acad. Sci. USA 101, 5241-5248.
320. Winfree, A. T., 1974. Rotating chemical reactions. Sci. Am. 230(6), 82-95.
321. Winfree, A. T., 2000. The Geometry of Biological Time. Springer, New York, 2nd ed.
322. Wu, F. and Huberman, B. A., 2004. Finding communities in linear time: A physics approach. Eur. Phys. J. B 38, 331-338.
323. Wuchty, S., 2001. Scale-free behavior in protein domain networks. Mol. Biol. Evol. 18, 1694-1702.
324. Wuchty, S., 2002. Interaction and domain networks of yeast. Proteomics 2, 1715-1723.
325. Wuchty, S., Oltvai, Z., andBarabási, A.-L., 2003. Evolutionary conservation of motif constituents within the yeast protein interaction network. Nature Genetics 35, 176-179.
326. Yook, S. H., Jeong, H., and Barabási, A.-L., 2001. Modeling the Internet's large-scale topology. Proc. Natl. Acad. Sci. USA 99, 13382-13386.
327. Zhabotinsky, A. M., 1991. A history of chemical oscillations and waves. Chaos 1, 379-386.
328. Zhu, J.-Y. and Zhu, H., 2002. Introducing small-world network effects to critical dynamics. Phys. Rev. E 67, 026125.