Network science

Annual Review of Information Science and Technology

Volumn 41, Issue , 2007, Pages 537-607

  Börner, Katy ^a   Sanyal, Soma ^a   Vespignani, Alessandro ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33846115649     PISSN: 00664200     EISSN: None     Source Type: Book Series    
DOI: 10.1002/aris.2007.1440410119     Document Type: Article

References (167)

1. Adamic, L., & Adar, E. (2003). Friends and neighbors on the Web. Social Networks, 25, 211-230.
2. Adamic, L. A., Lukose, R. M., Puniyani, A. R., & Huberman, B. A. (2001). Search in power-law networks. Physical Review E, 64, 46135.
3. Albert, R., & Barabási, A.-L. (2002). Statistical mechanics of complex networks. Reviews of Modern Physics, 74, 47-97.
4. Albert, R., Jeong, H., & Barabási, A.-L. (2000). Error and attack tolerance in complex networks. Nature, 406, 378.
5. Bader, G. D., & Hogue, C. W. V. (2002). Analyzing yeast protein-protein interaction data obtained from different sources. Nature Biotechnology, 20, 991-997.
6. Banks, B. D., & Carley, K. (1996). Models for network evolution. Journal of Mathematical Sociology, 21, 173-196.
7. Barabási, A.-L. (2002). Linked: The new science of networks. New York: Plume.
8. Barabási, A.-L. & Albert, R. (1999). Emergence of scaling in random networks. Science, 286, 509-512.
9. Barabási, A.-L., Albert, R., & Jeong, H. (1999). Mean-field theory for scale-free random networks. Physica A. 272, 173.
10. Barabási, A.-L., & Oltvai, Z. N. (2004). Network biology: Understanding the cell's functional organization. Nature Reviews Genetics, I, 101-113.
11. Barrat, A., Barthelemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences of the United States of America, 101, 3747-3752.
12. Barrat, A., & Weigt, M. (2000). On the properties of small-world network models. European Physical Journal B, 13, 547-560.
13. Barthelemy, M., & Amaral, L. A. N. (1999a), Erratum: Small-world networks: Evidence for a crossover picture. Physical Review Letters, 82, 5180.
14. Barthelemy, M., & Amaral, L. A. N. (1999b). Small-world networks: Evidence for a crossover picture. Physical Review Letters, 82, 3180-3183.
15. Bederson, B. B. (2004). Interfaces for staying in the flow. Ubiquity, 5(27), Retrieved March 22, 2006, from www.acm.org/ubiquity/views/ v5i27_bederson.html
16. Berg, J., & Lassig, M. (2002). Correlated random networks. Physical Review Letters, 89, 228701-228705.
17. Bertin, J. (1981). Graphics and graphic information-processing. Berlin: Walter de Gruyter.
18. Bettencourt, L. M. A., Cintron-Arias, A., Kaiser, D. I., & Castillo-Chavez, C. (2005). The power of a good idea: Quantitative modeling of the spread of ideas from epidemiological models. Retrieved March 22, 2006, from http://arxiv.org/PS_cache/physics/pdf/0502/0502067.pdf
19. Bianconi, G., & Capocci, A. (2003). Number of loops of size h in scale-free networks. Physical Review Letters, 90, 078701-1-078701-4.
20. Blatt, M., Wiseman, S., & Domany, E. (1996). Superparamagnetic clustering of data. Physical Review Letters, 76, 3251-3254.
21. Blatt, M., Wiseman, S., & Domany, E. (1997). Data clustering using a model granular magnet. Neural Computing, 9, 1805-1842.
22. Bollobas, B. (1998). Modern graph theory. New York: Springer.
23. Börner, K. (2006). Semantic association networks: Using Semantic Web technology to improve scholarly knowledge and expertise management. In V. G. C. Chen (Ed.), Visualizing the Semantic Web (pp. 183-198). Berlin: Springer.
24. Börner, K., Chen, C., & Boyack, K. (2003). Visualizing knowledge domains. Annual Review of Information Science and Technology, 37, 179-255.
25. Börner, K., Maru, J. T., & Goldstone, R. L. (2003). The simultaneous evolution of author and paper networks. Proceedings of the National Academy of Sciences of the United States of America, 101(Suppl. 1), 5266-5273.
26. Brandes, U. (2001). A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25, 163-177.
27. Brandes, U., & Erlebach, T. (2005). Network analysis: Methodological foundations. Berlin: Springer.
28. Broder, A. Z., Kumar, R., Maghoul, F., Raghavan, R, Rajagopalan, S., Stata, R., et al. (2000). Graph structure in the Web. Computer Networks, 33, 309-320.
29. Buchanan, M. (2002). Nexus: Small worlds and the groundbreaking science of networks. New York: Norton.
30. Burda, Z., & Krzywicki, A. (2003). Uncorrelated random networks. Physical Review E, 67, 046118.
31. Burda, Z., Jurkiewicz, J., & Krzywicki, A. (2003). Statistical mechanics of random graphs. Retrieved March 22, 2006, from http://arxiv.org/PS_cache/cond-mat/pdf70312/0312494.pdf
32. Carrington, P., Scott, J., & Wasserman, S. (2004). Models and methods in social network analysis. New York: Cambridge University Press.
33. Chakrabarti, S., Dom, B., Gibson, D., Kleinberg, J., Kumar, S. R., Raghavan, P., et al. (1999). Hypersearching the Web. Scientific American, 280(6), 44-52.
34. Chartrand, G., & Lesniak, L. (1986). Graphs and digraphs. Menlo Park, CA: Wadsworth & Brooks/Cole.
35. Chen, C. (2004). Searching for intellectual turning points: Progressive knowledge domain visualization. Proceedings of the National Academy of Sciences of the United States of America, 101(Suppl. 1), 5303-5310.
36. Chen, C. H. (1999, August). Extensions of generalized association plots (GAP). Paper presented at the Annual Meeting of the American Statistical Association, Baltimore, MD.
37. Chung, Y. M., & Lee, Y. J. (2001). A corpus-based approach to comparative evaluation of statistical term association measures. Journal of the American Society for Information Science and Technology, 52, 283-296.
38. Clauset, A., & Moore, C. (2005). Accuracy and scaling phenomena in Internet mapping. Physical Review Letters, 94, 018701.
39. Cohen, R., Erez, K., Ben-Avraham, D., & Havlin, S. (2000). Resilience of the Internet to random breakdowns. Physical Review Letters, 85, 4626-4629.
40. Cronin, B., & Atkins, H. B. (Eds.). (2000). The web of knowledge: A Festschrift in honor of Eugene Garfield. Medford, NJ: Information Today.
41. Csikszentmihalyi, M. (1991). Flow: The psychology of optimal experience. New York: HarperCollins.
42. Daley, D. J., Gani, J., & Cannings, C. (1999). Epidemic modeling: An introduction. Cambridge, UK: Cambridge University Press.
43. Dall'Asta, L., Alvarez-Hamelin, I., Barrat, A., Vazquez, A., & Vespignani, A. (2005). Traceroute-like exploration of unknown networks: A statistical analysis. In A. López-Ortiz & A. Hamel (Eds.), Combinatorial and algorithmic aspects of networking (pp. 140-153). Berlin: Springer.
44. Davidson, G. S., Wylie, B. N., & Boyack, K. W. (2001). Cluster stability and the use of noise in interpretation of clustering. Proceedings of the IEEE Symposium on Information Visualization, 23-30.
45. Deane, C. M., Salwinski, L., Xenarios, I., & Esenberg, D. (2002). Protein interactions: Two methods for assessment of the reliability of high throughput observations. Molecular Cell Proteomics, 1, 349-356.
46. de Jong, E. D., Thierens, D., & Watson, R. A. (2004). Hierarchical genetic algorithms. Parallel Problem Solving from Nature: Proceedings of the 8th International Conference, 232-241.
47. de Nooy, W., Mrvar, A., & Batagelj, V. (2005). Exploratory social network analysis with Pajek. Cambridge, UK: Cambridge University Press.
48. Dhamija, R., Fisher, D., & Yee, K.-P. (2000). Gnutellavision: Real-time visualization of a peer-to-peer network. Retrieved March 10, 2006, from http://bailando.sims.berkeley.edu/infovis/gtv
49. Battista, G., Eades, P., Tamassia, R., & Tollis, I. G. (1999). Graph drawing: Algorithms for the visualization of graphs. Upper Saddle River, NJ: Prentice Hall.
50. Dill, S., Kumar, S. R., McCurley, K. S., Rajagopalan, S., Sivakumar, D., & Tomkins, A. (2002). Self-similarity in the Web. ACM Transactions on Internet Technology, 2, 205-223.
51. Domany, E. (1999). Superparamagnetic clustering of data: The definitive solution of an illposed problem. Physics A, 263, 158-169.
52. Doreian, P., Batagelj, V., & Ferligoj, A. (2005). Generalized blockmodeling. Cambridge, UK: Cambridge University Press.
53. Dorogovtsev, S. N., & Mendes, J. F. F. (2002). Evolution of random networks. Advances in Physics, 51, 1079-1187.
54. Dorogovtsev, S. N., & Mendes, J. F. F. (2003). Evolution of networks. Oxford, UK: Oxford University Press.
55. Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2003). Principles of statistical mechanics of random networks. Nuclear Physics B, 666, 396.
56. Eades, P. (1984). A heuristic for graph drawing. Congressus Numerantium, 42, 149-160.
57. Erdós, P., & Rényi, P. (1959). On random graphs. Publications Mathematicae, 6, 290-297.
58. Euler, L. (1736). Solutio problematis ad geometriam situs pertinentis. Commetarii Academiae Scientiarum Imperialis Petropolitanae, 8, 128-140.
59. Farkas, I., Derenyi, I., Palla, G., & Vicsek, T. (2004). Equilibrium statistical mechanics of network structures. In E. Ben-Naim, H. Frauenfelder, & Z. Toroczkai (Eds.), Complex networks (Lecture Notes in Physics, 650) (pp. 163-187). Berlin: Springer.
60. Flake, G., Lawrence, S., & Giles, C. L. (2000). Efficient identification of Web communities. Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 150-160.
61. Fletcher, G., Sheth, H., & Börner, K. (2004). Unstructured peer-to-peer networks. In G. Moro, S. Bergamaschi, & K. Aberer (Eds.), Topological properties and search performance (Lecture Notes in Computer Science, 3601) (pp. 14-27). Berlin: Springer.
62. Frank, O. (2004). Network sampling and model fitting. In P. Carrington, J. Scott, & S. Wasserman (Eds.), Models and methods in social network analysis (pp. 31-56). New York: Cambridge University Press.
63. Frank, O., & Strauss, D. (1986). Markov graphs. Journal of the American Statistical Association, 81, 832-842.
64. Freeman, L. C. (1977). A set of measuring centrality based on betweenness. Sociometry, 40, 35-41.
65. Freeman, L. C. (2000). Visualizing social networks. Journal of Social Structure, 1(1). Retrieved March 22, 2006, from www.cmu.edu/joss/content/ articles/volume1/Freeman.html
66. Frick, A., Ludwig, A., & Mehldau, H. (1994). A fast adaptive layout algorithm for undirected graphs. Proceedings of Graph Drawing '94, 388-403.
67. Fronczak, P., Fronczak, A., & Holyst, J. A. (2005). Interplay between network structure and self-organized criticality. Retrieved March 22, 2006, from http://arxiv.org/PS_cache/cond-mat/pdf/0509/0509043.pdf
68. Fruchterman, T. M. J., & Reingold, E. M. (1991). Graph drawing by force-directed placement. Software-Practice & Experience, 21, 1129-1164.
69. Fry, B. (2000). Organic information design. Unpublished master's thesis, Massachusetts Institute of Technology.
70. Garfield, E., Sher, I. H., & Torpie, R. J. (1964). The use of citation data in writing the history of science. Philadelphia: Institute for Scientific Information.
71. Gibson, D., Kleinberg, J. M., & Raghavan, P. (1998). Inferring Web communities from link topology. Proceedings of the Ninth ACM Conference on Hypertext and Hypermedia, 225-234.
72. Gilbert, E. N. (1959). Random graphs. Annals of Mathematical Statistics, 30, 1141-1144.
73. Gimblett, H. R. (Ed.). (2002). Integrating geographic information systems and agent-based modeling techniques for simulating social and ecological processes. Oxford, UK: Oxford University Press.
74. Girvan, M., & Newman, M. (2002). Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America, 99, 7821-7826.
75. Granovetter, M. (1973). Strength of weak ties. American Journal of Sociology, 78, 1360-1380.
76. Gruhl, D., Guha, R., Tomkins, A., & Liben-Nowell, D. (2004, May). Information diffusion through blogspace. Paper presented at the Thirteenth International World Wide Web Conference. Retrieved March 10, 2006, from www2004.org/proceedings/docs/1p491.pdf
77. Guimera, R., Mossa, S., Turtschi, A., & Amaral, L. A. N. (2005). Structure and efficiency of the world-wide airport network. Proceedings of the National Academy of Sciences of the United States of America, 102, 7794-7799.
78. Hackos, J. T., & Redish, J. C. (1998). User and task analysis for interface design. New York: Wiley.
79. Han, K., & Ju, B.-H. (2003). A fast layout algorithm for protein interaction networks. Bioinformatics, 19, 1882-1888.
80. Hanneman, R. A., & Riddle, M. (2005). Introduction to social network methods: Centrality and power. Retrieved September 19, 2005, from http://faculty.ucr.edu/~hanneman/nettext/C10_Centrality.html
81. Hanson, N. (1958). Patterns of discovery. Cambridge, UK: Cambridge University Press.
82. Hartigan, J. (1972). Direct clustering of a data matrix. Journal of the American Statistical Association, 67(337), 123-129.
83. Herman, I., Melancon, G., & Marshall, M. S. (2000). Graph visualization and navigation in information visualization: A survey. IEEE transactions on Visualization and Computer Graphics, 6, 24-43.
84. Hodgman, T. C. (2000). A historical perspective on gene/protein functional assignment. Bioinformatics, 16, 10-15.
85. Holland, P. W., & Leinhardt, S. (1981). An exponential family of probability distributions for directed graphs. Journal of the American Statistical Association, 76(373), 33-50.
86. Huisman, M., & Van Duijn, M. A. J. (2005). Software for social network analysis. In P. J. Carrington, J. Scott, & S. Wasserman (Eds.), Models and methods in social network analysis (pp. 270-316). New York: Cambridge University Press.
87. Jaynes, E. T. (1957). Information theory and statistical mechanics. Physical Review, 106, 620-630.
88. Jungnickel, D. (1994). Graphs, networks and algorithms. Heidelberg, Germany: Springer.
89. Kamada, T., & Kawai, S. (1989). An algorithm for drawing general undirected graphs. Information Processing Letters, 31, 7-15.
90. Kauffman, S., Peterson, C., Samuelsson, B., & Troein, C. (2003). Random Boolean network models and the yeast transcriptional network. Proceedings of the National Academy of Sciences of the United States of America, 100, 14796-14799.
91. Kim, J.-O., & Mueller, C. (1978). Factor analysis: Statistical methods and practical issues. Thousand Oaks, CA: Sage.
92. Kleinberg, J. (2000). The small-world phenomenon: An algorithmic perspective. Proceedings of the 32nd ACM Symposium on Theory of Computing, 163-170.
93. Kleinberg, J., & Lawrence, S. (2001). The structure of the Web. Science, 294, 1849-1850.
94. Krapivsky, P. L., & Redner, S. (2003). Rate equation approach for growing networks. In R. Pastor-Satorras, M. Rubi, & A. Diaz-Guilera (Eds.), Statistical mechanics of complex networks (Lecture Notes in Physics 625) (pp. 3-22). Berlin: Springer.
95. Krapivsky, P. L., & Redner, S. (2005). Network growth by copying. Physical Review E, 71, 036118-1-036118-8.
96. Krzywicki, A. (2001). Defining statistical ensembles of random graphs. Retrieved March 22, 2006, from http://arxiv.org/PS_cache/cond-mat/ pdf/0110/0110574.pdf
97. Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., & Upfall, E. (2000). Stochastic models for the Web graph. Proceedings of the 41st IEEE Symposium on Foundations of Computer Sciences, 57-65.
98. Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999). Trawling the Web for emerging cyber-communities. Computer Networks, 31, 1481-1493.
99. Lakhina, A., Byers, J., Crovella, M., & Xie, P. (2002). Sampling biases in IP topology measurements (Technical Report BUCS-TR-2002-021). Boston: Boston University Computer Science Department.
100. Lamping, J., Rao, R., & Pirolli, P. (1995). A focus+context technique based on hyperbolic geometry for visualizing large hierarchies. Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, 401-408.
101. Lee, E. J. (2005). Robustness of the avalanche dynamics in data packet transport on scale-free networks. Physical Review E, 71, 056108.
102. Liljeros, F., Edling, C. R., Amaral, L. A. N., Stanley, H. E., & Aberg, Y. (2001). The web of sexual contacts. Nature, 411, 907-908.
103. Lynch, M. F. (1977). Variety generation: A reinterpretation of Shannon's mathematical theory of communications, and its implication for information science. Journal of the American Society for Information Science, 28, 19-25.
104. MacEachren, A. M. (1995). How maps work: Representation, visualization and design. New York: Guildford Press.
105. May, R. M., & Lloyd, A. L. (2001). Infection dynamics on scale-free networks. Physical Review E. 64, 066112.
106. McFadzean, D., & Tesfatsion, L. (1997). An agent-based computational model for the evolution of trade networks. Computing in Economics and Finance, 110. Retrieved March 16, 2006, from http://bucky.stanford.edu/ cef97/abstracts/mcfadzean.html
107. Merton, R. K. (1968). The Matthew effect in science: The reward and communication systems of science are considered. Science, 159(810), 56-63.
108. Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002). Network motifs: Simple building blocks of complex networks. Science, 298(5594), 824-827.
109. Molloy, M., & Reed, B. (1995). A critical point for random graphs with a given degree sequence. Random Structures Algorithms, 6, 161-174.
110. Monge, P. R., & Contractor, N. (2003). Theories of communication networks. New York: Oxford University Press.
111. Moreno, J. L. (1934). Who shall survive? Anew approach to the problems of human interrelations. Washington, DC: Nervous and Mental Disease Publishing Company.
112. Moreno, J. L. (1943). Sociometry and the social order. Sociometry, 6, 299-344.
113. Moreno, Y., Pastor-Satorras, R.,Vazquez, A., & Vespignani, A. (2003). Critical load and congestion instabilities in scale-free networks. Europhysics Letters, 62, 292.
114. Motter, A. E., & Lai, Y. C. (2002). Cascade based attacks on complex networks. Physical Review E, 66, 065102.
115. Mueller, C. (2004). Sparse matrix reordering algorithms for cluster identification. Retrieved March 20, 2006, from www.osl.iu.edu/~chemuell/ projects/bioinf/sparse-matrix-clustering-chris-mueller.pdf
116. Munzner, T. (1998). Exploring large graphs in 3D hyperbolic space. IEEE Computer Graphics and Applications, 18(4), 18-23.
117. Newman, M. (2003). The structure and function of complex networks. SIAM Review, 45, 167-256.
118. Newman, M., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69, 026113.
119. Newman, M. E. J. (2001). The structure of scientific network collaborations. Proceedings of the National Academy of Sciences of the United States of America, 98, 404-409.
120. Newman, M. E. J. (2002). Assortative mixing in networks. Physical Review Letters, 89, 208701.
121. Palla, G., Derenyi, I., Farkas, I., & Vicsek, T. (2005). Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435(7043), 814-818.
122. Palmer, S. E. (1999). Vision science: From photons to phenomenology. Cambridge, MA: MIT Press.
123. Parisi, G. (1988). Statistical field theory. Redwood City, CA: Addison-Wesley.
124. Park, J., & Newman, M. E. J. (2004). The statistical mechanics of networks. Physical Review E, 70, 066117.
125. Pastor-Satorras, R., & Vespignani, A. (2001). Epidemic spreading in scale-free networks. Physical Review Letters, 86, 3200-3203.
126. Pastor-Satorras, R., & Vespignani, A. (2002). Epidemic dynamics and endemic states in complex networks. Physical Review E, 63, 036104.
127. Pastor-Satorras, R., & Vespignani, A. (2004). Evolution and structure of the Internet: A statistical physics approach. Cambridge, UK: Cambridge University Press.
128. Petermann, T., & De Los Rios, P. (2004). Exploration of scale-free networks. European Physical Journal B, 38, 201-204.
129. Popper, K. (1959). The logic of scientific discovery. New York: Basic Books.
130. Price, D. J. D. (1976). A general theory of bibliometric and other cumulative advantage processes. Journal of the American Society for Information Science, 27, 292-306.
131. Pudovkin, A. I., & Garfield, E. (2002). Algorithmic procedure for finding semantically related journals. Journal of the American Association of Information Science and Technology, 53, 1113-1119.
132. Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., & Barabási, A.-L. (2002). Hierarchical organization of modularity in metabolic networks. Science, 297, 1551-1555.
133. Redner, S. (1998). How popular is your paper? An empirical study of the citation distribution. European Physical Journal B, 4, 131-134.
134. Redner, S. (2005). Citation statistics from 110 years of Physical Review. Physics Today, 58, 49-54.
135. Reichardt, J., & Bornholdt, S. (2004). Detecting fuzzy community structures in complex networks with a Potts model. Physical Review Letters, 93(21), 218701.
136. Rettig, J. L. (1978). A theoretical model and definition of the reference process. RQ, 18, 19-29.
137. Sanil, A., Banks, D., & Carley, K. (1995). Models for evolving fixed node networks: Model fitting and model testing. Social Networks, 17, 65-81.
138. Schneeberger, A., Mercer, C. H., Gregson, S. A., Ferguson, N. M., Nyamukapa, A., Anderson, R. M., et al. (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.
139. Schvaneveldt, R. W. (1990). Pathfinder associative networks: Studies in knowledge organization. Norwood, NJ: Ablex.
140. Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27, 379-423, 623-656.
141. Shannon, C. E., & Weaver, W. (1949). The mathematical theory of communication. Urbana: University of Illinois Press.
142. Shen-Orr, S., Milo, R., Mangan, S., & Alon, U. (2002). Network motifs in the transcriptional regulation network of Escherichia coli. Nature Genetics, 31, 64-68.
143. Shneiderman, B. (1987). Designing the user interface: Strategies for effective human-computer interaction. Reading, MA: Addison-Wesley.
144. Shneiderman, B. (1992). Tree visualization with tree-maps: A 2-D space filling approach. ACM Transactions on Graphics, 11, 92-99.
145. Shneiderman, B. (1996). The eyes have it: A task by data type taxonomy for information visualizations. Proceedings of the IEEE Symposium on Visual Languages, 336-343.
146. Shneiderman, B. (2005). Treemaps for space-constrained visualization of hierarchies. Retrieved August 6, 2005, from www.cs.umd.edu/hcil/treemap-history/ index.shtml
147. Simon, H. A. (1955). On a class of skew distribution functions. Biometrika, 42, 425-450.
148. Snijders, T. (2002). Markov chain Monte Carlo estimation of exponential random graph models. Journal of Social Structure, 3. Retrieved March 22, 2006, from www.cmu.edu/joss/content/articles/volume3/Snijders.pdf
149. Standish, R. K., & Galloway, J. (2002). Visualising Tierra's tree of life using Netmap. Retrieved March 10, 2006, from http://parallel.hpc. unsw.edu.au/rks/docs/netmap
150. Strauss, D. (1986). On a general class of models for interaction. SIAM Review, 28, 513-527.
151. Strauss, D., & Ikeda, M. (1990). Pseudolikelihood estimation for social networks. Journal of the American Statistical Association, 85, 204-212.
152. Strogatz, S. H. (2001). Exploring complex networks. Nature, 410, 268-276.
153. Tabah, A. N. (1999). Literature dynamics: Studies on growth, diffusion, and epidemics. Annual Review of Information Science and Technology, 34, 249-286.
154. Thelwall, M. (2004). Link analysis: An information science approach. Amsterdam: Academic Press.
155. Tufte, E. R. (1983). The visual display of quantitative information. Cheshire, CT: Graphics Press.
156. Vazquez, A., de Menezes, M. A., Oltvai, Z. N., & Barabási, A.-L. (2004). Predicting the location and behavior of metabolic switches based on an optimal growth efficiency principle (Technical Report). South Bend, IN: University of Notre Dame.
157. Venn, J. (1971). Symbolic logic. Bronx, NY: Chelsea Publishing Company. (Original work published 1894)
158. Walshaw, C. (2000). A multilevel algorithm for force-directed graph drawing. Proceedings of the 8th International Symposium Graph Drawing, 171-182.
159. Ware, C. (2000). Information visualization: Perception for design. San Francisco: Morgan Kaufmann.
160. Wasserman, S., & Faust, K. (1994). Social network analysis: Methods and applications. Cambridge, UK: Cambridge University Press.
161. Wasserman, S., & Pattison, P. (1996). Logit models and logistic regressions for social networks. Psychosometrika, 61, 401-426.
162. Watts, D. J. (1999). Small world. Princeton, NJ: Princeton University Press.
163. Watts, D. J., & Strogatz, S. H. (1998). Collective dynamics of small-world networks. Nature, 393, 440-442.
164. Wolf, Y. I., Karev, G., & Koonin, E. V. (2002). Scale-free networks in biology: New insights into the fundamentals of evolution? Bioessays, 24, 105-109.
165. Wuchty, S., Oltvai, Z. N., & Barabási, A.-L. (2003). Evolutionary conservation of motif constituents in the yeast protein interaction network. Nature Genetics, 35, 176-177.
166. Yee, K.-P, Fisher, D., Dhamija, R., & Hearst, M. (2001). Animated exploration of graphs with radial layout. Proceedings of the IEEE Symposium on Information Visualization, 43-50.
167. Zhou, S., & Mondragon, R. J. (2004). Accurately modeling the Internet topology. Physical Review E, 70, 066108-1-066108-8.