Techniques for analyzing dynamic random graph models of Web-like networks: An overview

Networks

Volumn 51, Issue 4, 2008, Pages 211-255

  Cami, Aurel ^a   Deo, Narsingh ^a  

^a University of Central Florida   (United States)

Author keywords

Dynamic random graphs; Scale free networks; Web graphs

Indexed keywords

DYNAMIC RANDOM GRAPHS; RANDOM GRAPH MODELS; SCALE-FREE NETWORKS; WEB GRAPHS;

COMPUTER NETWORKS; DYNAMIC MODELS; GRAPH THEORY; INTERNET; PROBABILITY DISTRIBUTIONS; WORLD WIDE WEB;

RANDOM PROCESSES;

EID: 51449104504     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20215     Document Type: Article

References (202)

1. J. Abello, M.G.C. Resende, and S. Sudarsky, Massive quasi-clique detection, Proc 5th Latin American Symposium on Theoretical Informatics, Springer-Verlag, 2002, pp. 598-612.
2. L.A. Adamic, Networks: Theory and application, webpage, http://www-personal.umich.edu/~ladamic/si614w06/.
3. L.A. Adamic and B.A. Huberman, The web's hidden order, Commun ACM 44 (2001), 55-60.
4. L.A. Adamic, R.M. Lukose, A.R. Puniyani, and B.A. Huberman, Search in power-law networks 2, Physical Review E (Statistical Nonlinear and Soft Matter Physics) 4 (2001), art. no. 046135.
5. W. Aiello, F. Chung, and L. Lu, A random graph model for power law graphs, Experiment Math 10 (2001), 53-66.
6. W. Aiello, F. Chung, and L. Lu, "Random evolution in massive graphs," Handbook of massive data sets, J. Abello, P.M. Pardalos, and M.G. Resende (Editors), vol. 4, Kluwer, Dordrecht, 2002, pp. 97-122.
7. E.M. Airoldi and K.M. Carley, Sampling algorithms for pure network topologies: A study on the stability and the separability of metric embeddings, SIGKDD Explor Newsle 7 (2005), 13-22.
8. R. Albert and A.-L. Barabási, Topology of evolving networks: Local events and universality, Phys Rev Lett 85 (2000), 5234-5237.
9. R. Albert and A.-L. Barabási, Statistical mechanics of complex networks, Rev Mod Phys 74 (2002), 47-97.
10. R. Albert, J. Hawoong, and A.-L. Barabási, Error and attack tolerance of complex networks, Nature 406 (2000), 378-382.
11. R. Albert, H. Jeong, and A.-L. Barabási, Diameter of the world wide web, Nature 401 (1999), 130-131.
12. D. Alderson, J. Doyle, G. Ramesh, and W. Willinger, Toward an optimization-driven framework for designing and generating realistic Internet topologies, Comput Commun Rev 33 (2003), 41-46.
13. D.J. Aldous, A tractable complex network model based on the stochastic mean-field model of distance, Lecture Notes Phys 650 (2004), 51-87.
14. E. Almaas, R. V. Kulkarni, and D. Stroud, Characterizing the structure of small-world networks, Phys Rev Lett 88 (2002), art. no. 098101.
15. R. Andersen, F. Chung, and L. Lu, Modeling the smallworld phenomenon with local network flow, Internet Math 2 (2005), 359-385.
16. K. Azuma, Weighted sums of certain dependent variables, Tohoku Math J 3 (1967), 357-367.
17. R. Baeza-Yates, C. Castillo, M. Marin, and A. Rodriguez, Crawling a country: Better strategies than breadth-first for web page ordering, Special Interest Tracks and Posters, 14th International Conference on World Wide Web, ACM Press, 2005, pp. 864-872.
18. P. Baldi, P. Frasconi, and P. Smyth, Modeling the Internet and the Web: Probabilistic methods and algorithms, John Wiley & Sons, Chichester, England; Hoboken, NJ, 2003.
19. Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz, Approximating aggregate queries about web pages via random walks, Proc 26th International Conference on Very Large Data Bases, Morgan Kaufmann, 2000, pp.535-544.
20. Z. Bar-Yossef, A.Z. Broder, R. Kumar, and A. Tomkins, Sic transit gloria telae: Towards an understanding of the web's decay, Proc 13th International Conference on World Wide Web, ACM Press, 2004, pp. 328-337.
21. Z. Bar-Yossef and M. Gurevich, Random sampling from a search engine's index, Proc 15th International Conference on World Wide Web, ACM Press, 2006, pp. 367-376.
22. A.-L. Barabási, Linked: The new science of networks, Perseus, Cambridge, MA, 2002.
23. A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509-512.
24. A.-L. Barabási, R. Albert, and H. Jeong, Mean-field theory for scale-free random networks, Physica A: Statistical Mechan Appl 272 (1999), 173-187.
25. A.-L. Barabási, R. Albert, and H. Jeong, Scale-free characteristics of random networks: The topology of the World-Wide Web, Phys A: Statis Mechan Appl 281 (2000), 69-77.
26. A. Barrat and M. Weigt, On the properties of small-world network models, Eur Phys J B 13 (2000), 547-560.
27. M. Barthélemy and L.A.N. Amaral, Small-world networks: Evidence for a crossover picture, Phys Rev Lett 82 (1999), 3180-3183.
28. M. Barthélemy, A. Barrat, R. Pastor-Satorras, and A. Vespignani, Velocity and hierarchical spread of epidemic outbreaks in scale-free networks, Phys Rev Lett 17 (2004), art. no. 178701.
29. L. Becchetti, C. Castillo, D. Donato, S. Leonardi, and R. Baeza-Yates, Using rank propagation and probabilistic counting for link-based spam detection, preprint, http://delis.upb.de/paper/DELIS-TR-0341.pdf.
30. E.A. Bender and E.R. Canfield, The asymptotic number of labeled graphs with given degree sequences, J Combinatorial Theory Ser A 24 (1978), 296-307.
31. K. Berberich, M. Vazirgiannis, and G. Weikum, Time-aware authority ranking, Internet Math 2 (2005), 301-332.
32. N. Berger, B. Bollobás, C. Borgs, J. Chayes, and O. Riordan, "Degree distribution of the FKP network model," Automata, languages and programming, J.C.M. Baeten, J.K. Lenstra, J. Parrow, and G.J. Woeginger (Editors), vol. 2719, Springer-Verlag, Berlin, 2003, pp. 725-738.
33. I. Bezáková, A. Kalai, and R. Santhanam, Graph model selection using maximum likelihood, Proc 23rd International Conference on Machine Learning, ACM Press, 2006, pp. 105-112.
34. G. Bianconi, Number of cycles in off-equilibrium scale-free networks and in the Internet at the autonomous system level, Eur Phys J B 38 (2004), 223-230.
35. G. Bianconi and A.-L. Barabási, Competition and multiscaling in evolving networks, Europhys Lett 54 (2001), 436-442.
36. G. Bianconi and A. Capocci, Number of loops of size h in growing scale-free networks, Phys Rev Lett 7 (2003), art. no. 078701.
37. T. Bohman, O. Pikhurkho, B. Sudakov, A. Rucinski, N. Wormald, M. Molloy, D. Achlioptas, and A. Frieze, Eight lectures on random graphs, webpage. http://www.math.cmu.edu/~af1p/MAA2005/MAA.html.
38. P. Boldi, M. Santini, and S. Vigna, Paradoxical effects in PageRank incremental computations, Internet Math 2 (2005), 387-404.
39. B. Bollobás, Graph theory: An introductory course, Springer Verlag, New York, 1979.
40. B. Bollobás, Random graphs, Academic Press, London, Orlando, 1985.
41. B. Bollobás, The diameter of random graphs, IEEE Trans Inform Theory 36 (1990), 285-288.
42. B. Bollobás, C. Borgs, J. Chayes, and O. Riordan, Directed scale-free graphs, Proc 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2003, pp. 132-139.
43. B. Bollobás, S. Janson, and O. Riordan, The phase transition in the uniformly grown random graph has infinite order, Random Struct Algorithms 26 (2005), 1-36.
44. B. Bollobás and O. Riordan, Robustness and vulnerability of scale-free random graphs, Internet Math 1 (2003), 1-35.
45. B. Bollobás and O. Riordan, "Mathematical results on scalefree random graphs," Handbook of graphs and networks: From the genome to the Internet, S. Bornholdt and H.G. Schuster (Editors), Wiley-VCH, Weinheim, 2003, pp. 1-34.
46. B. Bollobás and O. Riordan, Coupling scale-free and classical random graphs, Internet Math 1 (2004), 215-225.
47. B. Bollobás and O. Riordan, The diameter of a scale-free random graph, Combinatorica 24 (2004), 5-34.
48. B. Bollobás and O. Riordan, Shortest paths and load scaling in scale-free trees, Phys Rev E (Statistical Nonlinear and Soft Matter Physics) 3 (2004), art. no. 036114.
49. B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády, The degree sequence of a scale-free random graph process, Random Struct Algorithms 18 (2001), 279-290.
50. A. Bonato, A survey of models of the web graph, Proc 1st Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2004), Lecture Notes in Computer Science 3405, Springer, Berlin, 2005, pp. 159-172.
51. A. Bonato and J. Janssen, Infinite limits of copying models of the web graph, Internet Math 1 (2004), 193-213.
52. 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-320.
53. M. Buchanan, Nexus: Small worlds and the groundbreaking science of networks, W.W. Norton, New York, NY, 2002.
54. RG. Buckley and D. Osthus, Popularity based random graph models leading to a scale-free degree sequence, Discrete Math 282 (2004), 53-68.
55. J.D. Burtin, Extremal metric characteristics of a random graph I, Theo Verojatnost i Primenen 19 (1974), 740-754.
56. G. Caldarelli, R. Pastor-Satorras, and A. Vespignani, Structure of cycles and local ordering in complex networks, Eur Phys J B 38 (2004), 183-186.
57. D.S. Callaway, J.E. Hopcroft, J.M. Kleinberg, M.E. Newman, and S.H. Strogatz, Are randomly grown graphs really random? Part 1, Phys Rev E (Statistical Nonlinear and Soft Matter Physics) 4 (2001), art. no. 041902.
58. D.S. Callaway, M.E.J. Newman, S.H. Strogatz, and D.J. Watts, Network robustness and fragility: Percolation on random graphs, Phys Rev Lett 25 (2000), art. no. 5468.
59. S. Chakrabarti, A. Frieze, and J. Vera, The influence of search engines on preferential attachment, Proc 16th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2005, pp. 293-300.
60. Q. Chen, H. Chang, R. Govindan, and S. Jamin, The origin of power laws in internet topologies revisited, Proc 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), 2002, pp. 608-617.
61. S. Chien, C. Dwork, R. Kumar, D.R. Simon, and D. Sivakumar, Link evolution: Analysis and algorithms, Internet Math 1 (2004), 277-304.
62. J. Cho, H. Garcia-Molina, and L. Page, Efficient crawling through URL ordering, Comput Networks ISDN Syst 30 (1998), 161-172.
63. F. Chung, Combinatorics of large sparse graphs, webpage. http://www.math.ucsd.edu/~fan/teach/262/notes/04/.
64. F. Chung, A brief overview of network algorithms, J Comput Syst Sci 72 (2006), 420-424.
65. F. Chung and L. Lu, Concentration inequalities and martingale inequalities -A survey, Internet Math 3 (2006), 79-127.
66. F. Chung and L. Lu, The diameter of sparse random graphs, Adv Appl Math 26 (2001), 257-279.
67. F. Chung and L. Lu, Connected components in random graphs with given expected degree sequences, Ann Comb 6 (2002), 125-145.
68. F. Chung and L. Lu, The average distance in a random graph with given expected degrees, Internet Math 1 (2003), 91-113.
69. F. Chung and L. Lu, Coupling online and offline analyses for random power law graphs, Internet Math 1 (2004), 409-461.
70. F. Chung and L. Lu, Complex graphs and networks, American Mathematical Society, Providence, RI, 2006.
71. F. Chung, L. Lu, and V. Vu, Spectra of random graphs with given expected degrees, Proc Natl Acad Sci USA 100 (2003), 6313-6318.
72. R. Cohen, K. Erez, D. Ben-Avraham, and S. Havlin, Resilience of the Internet to random breakdowns, Phys Rev Lett 85 (2000), 4626-2628.
73. R. Cohen, K. Erez, D. Ben-Avraham, and S. Havlin, Breakdown of the Internet under intentional attack, Phys Rev Lett 86 (2001), 3682-3685.
74. C. Cooper and A. Frieze, A general model of Web graphs, Random Struct Algorithms 22 (2003), 311-335.
75. C. Cooper and A. Frieze, Crawling on simple models of Web graphs, Internet Math 1 (2003), 57-90.
76. C. Cooper and A. Frieze, The size of the largest strongly connected component of a random digraph with a given degree sequence, Combinatorial Probab Comput 13 (2004), 319-337.
77. C. Cooper, A. Frieze, and J. Vera, Random deletions in a scale free random graph process, Internet Math 1 (2004), 463-483.
78. C. Cooper, R. Klasing, and M. Zito, Lower bounds and algorithms for dominating sets in Web graphs, Internet Math 2 (2005), 275-300.
79. G.M. Del Corso, A. Gull, and F. Romani, Fast PageRank computation via a sparse linear system, Internet Math 2 (2005), 251-273.
80. N. Deo, Graph theory with applications to engineering and computer science, Prentice-Hall, Englewood Cliffs, NJ, 1974.
81. N. Deo and A. Cami, Preferential deletion in dynamic models of web-like networks, Information Process Lett 102 (2007), 156-162.
82. N. Deo and P. Gupta, Graph-theoretic analysis of the World Wide Web: New directions and challenges, Mat Contemp 25 (2003), 49-69.
83. Z. Dezso and A.-L. Barabási, Halting viruses in scale-free networks Part 2, Phys Rev E (Statistical Nonlinear and Soft Matter Physics) 5 (2002), art. no. 055103.
84. J. Diaz, J. Petit, and M. Serna, "A guide to concentration bounds," Handbook of randomized computing, P. Rajasekaran, P. Pardalos, J. Reif, and J. Rolim (Editors), vol. 2, 2001, pp. 457-507.
85. R. Diestel, Graph theory, Springer, New York, 2000.
86. S. Dill, R. Kumar, K.S. McCurley, S. Rajagopalan, D. Sivakumar, and A. Tomkins, Self-similarity in the Web, Proc 27th International Conference on Very Large Data Bases (VLDB '01), Morgan Kaufmann, 2001, pp. 69-78.
87. S.N. Dorogovtsev, A.V. Goltsev, and J.F.F. Mendes, K-core percolation and K-core organization of complex networks, Phys Rev Lett 96 (2005), art. no. 040601.
88. S.N. Dorogovtsev, A.V. Goltsev, J.F.F. Mendes, and A.N. Samukhin, Spectra of complex networks, Phys Rev E (Statistical, Nonlinear, and Soft Matter Physics) 4 (2003), art. no. 46109.
89. S.N. Dorogovtsev, A.V. Goltsev, J.F.F. Mendes, and A.N. Samukhin, Random networks: Eigenvalue spectra, Phys A: Statistical Mechan Appl 338 (2004), 76-83.
90. S.N. Dorogovtsev and J.F.F. Mendes, Scaling behaviour of developing and decaying networks, Europhys Lett 52 (2000), 33-39.
91. S.N. Dorogovtsev and J.F.F. Mendes, Evolution of networks with aging of sites, Phys Rev E (Statistical Phys Plasmas, Fluids, Related Interdisciplinary Topics) 62 (2000), 1842-1845.
92. S.N. Dorogovtsev and J.F.F. Mendes, Scaling properties of scale-free evolving networks: Continuous approach Part 1-2, Phys Rev E (Statistical, Nonlinear, and Soft Matter Phys) 5 (2001), art. no. 056125/1.
93. S.N. Dorogovtsev and J.F.F. Mendes, Effect of the accelerating growth of communications networks on their structure Part 1-2, Phys Rev E (Statistical, Nonlinear, Soft Matter Phys) 2 (2001), art. no. 025101.
94. S.N. Dorogovtsev and J.F.F. Mendes, Evolution of networks, Adv Phys 51 (2002), 1079-1187.
95. S.N. Dorogovtsev and J.F.F. Mendes, Evolution of networks: From biological nets to the Internet and WWW, Oxford University Press, Oxford, 2003.
96. S.N. Dorogovtsev, J.F.F. Mendes, and A.N. Samukhin, Structure of growing networks with preferential linking, Phys Rev Lett 85 (2000), 4633-4636.
97. S.N. Dorogovtsev, J.F.F. Mendes, and A.N. Samukhin, Giant strongly connected component of directed networks, Phys Rev E (Statistical Nonlinear Soft Matter Phys) 2 (2001), art. no. 025101.
98. S.N. Dorogovtsev, J.F.F. Mendes, and A.N. Samukhin, Anomalous percolation properties of growing networks, Phys Rev E (Statistical Nonlinear Soft Matter Phys) 6 (2001), art. no. 066110.
99. R. Durrett, Rigorous results for the CHKNS random graph model, Proc Discrete Random Walks 2003 (DRW'03), Assoc Discrete Math Theor Comput Sci (2003), pp. 95-104.
100. R. Durrett, Random graph dynamics, Cambridge University Press, New York, 2006.
101. V.M. Egufluz, E. Hernandez-Garcia, O. Piro, and K. Klemm, Effective dimensions and percolation in hierarchically structured scale-free networks Part 2, Phys Rev E (Statistical Nonlinear and Soft Matter Physics) 5 (2003), art. no. 055102.
102. V.M. Eguíluz and K. Klemm, Epidemic threshold in structured scale-free networks, Phys Rev Lett 89 (2002), 108701.
103. S. Elaydi, An introduction to difference equations, Springer, New York, 1999.
104. P. Erdös and T. Gallai, Graphs with prescribed degrees of vertices, Mat Lapok 11 (1960), 264-274.
105. P. Erdös and A. Rényi, On random graphs. I, Publ Math Debrecen 6 (1959), 290-297.
106. P. Erdös and A. Rényi, On the evolution of random graphs, Magyar Tud Akad Mat Kutató Int Közl 5 (1960), 17-61.
107. G. Ergün and G.J. Rodgers, Growing random networks with fitness, Physica A 303 (2002), 261-272.
108. M. Faloutsos, P. Faloutsos, and C. Faloutsos, On powerlaw relationships of the Internet topology, Comput Commun Rev 29 (1999), 251-262.
109. I.J. Farkas, I. Derenyi, A.L. Barabási, and T. Vicsek, Spectra of "real-world" graphs: Beyond the semicircle law Part 2, Phys Rev E (Statistical Nonlinear Soft Matter Physics) 2 (2001), art. no. 026704.
110. A. Flaxman, A. Frieze, and J. Vera, A geometric preferential attachment model of networks, Proc 3rd International Workshop on Algorithms and Models for the Web-Graph (WAW 2004), Lecture Notes in Computer Science, Vol. 3243, 2004, pp. 44-55.
111. A. Flaxman, A. Frieze, and J. Vera, Adversarial deletion in a scale free random graph process, Proc 16th ACM-SIAM Symposium on Discrete Algorithms (SODA '05), Society for Industrial and Applied Mathematics, 2005, pp. 287-292.
112. D. Fogaras and R. Balazs, Scaling link-based similarity search, Proc 14th International Conference on World Wide Web, ACM Press, 2005, pp. 641-650.
113. D. Fogaras, B. Rcz, K. Csalogny, and T. Saris, Towards scaling fully personalized PageRank: Algorithms, lower bounds, and experiments, Internet Math 2 (2005), 333-358.
114. S. Fortunato, A. Flammini, and F. Menczer, Scale-free network growth by ranking, Phys Rev Lett 21 (2006), art. no. 218701.
115. A. Frieze, Web structure and algorithms, webpage, http://www.math.cmu. edu/~af1p/WWW2004/WWW2004.html.
116. A. Fronczak, J.A. Holyst, M. Jedynak, and J. Sienkiewicz, Higher order clustering coefficients in Barabasi-Albert networks, Phys A 316 (2002), 688-694.
117. L. Getoor and C.P. Diehl, Link mining: A survey, SIGKDD Explor Newsl 7 (2005), 3-12.
118. L. Getoor, E. Segal, B. Taskar, and D. Koller, Probabilistic models of text and link structure for hypertext classification, Presented at IJCAI Workshop on Text Learning: Beyond Supervision, http://www.cs.cmu.edu/~mccallum/ textbeyond/papers/getoor.ps, 2001.
119. D. Gibson, R. Kumar, and A. Tomkins, Discovering large dense subgraphs in massive graphs, Proc 31st International Conference on Very Large Databases, VLDB Endowment, 2005, pp. 721-732.
120. E.N. Gilbert, Random graphs, Ann Math Statist 30 (1959), 1141-1144.
121. K.I. Goh, B. Kahng, and D. Kim, Spectra and eigenvectors of scale-free networks Part 1, Phys Rev E (Statistical Nonlinear and Soft Matter Phys) 5 (2001), art. no. 051903.
122. K.I. Goh, B. Kahng, and D. Kim, Packet transport and load distribution in scale-free network models, Phys A: Statistical Mechanics Appl 318 (2003), 72-79.
123. K.I. Goh, E. Oh, B. Kahng, and D. Kim, Betweenness centrality correlation in social networks, Phys Rev E (Statistical Nonlinear Soft Matter Phys) 1 (2003), art. no. 17101.
124. R. Govindan and H. Tangmunarunkit, Heuristics for Internet map discovery, Proc 19th Conference on Computer Communications, Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM 2000), 2000, pp. 1371-1380.
125. A. Gulli and A. Signorini, The indexable Web is more than 11.5 billion pages, Special Interest Tracks and Posters of the 14th International Conference on World Wide Web, ACM Press, 2005, pp. 902-903.
126. P. Gupta and N. Deo, Diameter of a random graph and its implications for the Web graph, Congressus Numerantium 160(2003), 109-116.
127. S.L. Hakimi, On realizability of a set of integers as degrees of the vertices of a linear graph, J Soc Indust Appl Math 10 (1962), 496-506.
128. M.R. Henzinger, Algorithmic challenges in web search engines, Internet Math 1 (2003), 115-123.
129. M.R. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, On near-uniform URL sampling, Comput Networks 33 (2000), 295-308.
130. W. Hoeffding, Probability inequalities for sums of bounded random variables, J Amer Statist Assoc 58 (1963), 13-30.
131. J. Hopcroft, O. Khan, B. Kulis, and B. Selman, Tracking evolving communities in large linked networks, Proc Nat Acad Sci USA 101 Supplement 1 (2004), 5249-5253.
132. S. Janson, D.E. Knuth, T. Luczak, and B. Pittel, The birth of the giant component, Random Structures Algorithms 4 (1993), 231-358.
133. S. Janson, T. Luczak, and A. Rucinski, Random graphs, John Wiley, New York, NY, 2000.
134. C. Jordan, Calculus of finite differences, Chelsea, New York, NY, 1965.
135. P. Juyong and M.E.J. Newman, Origin of degree correlations in the Internet and other networks, Phys Rev E (Statistical Nonlinear and Soft Matter Phys) 2 (2003), art. no. 26112.
136. D. Kempe, J. Kleinberg, and E. Tardos, Influential nodes in a diffusion model for social networks, Proc 32nd International Colloquium on Automata, Languages and Programming, ICALP05 (Lecture Notes in Computer Science Vol. 3580) (2005), 1127-1138.
137. J. Kleinberg, The structure of information networks, webpage. http://www.cs.cornell.edu/Courses/cs685/2006sp/.
138. J. Kleinberg, Authoritative sources in a hyperlinked environment, J ACM 46 (1999), 604-632.
139. J. Kleinberg, The small-world phenomenon: An algorithmic perspective, Proc 32nd Annual ACM Symposium on Theory of Computing, ACM Press, 2000, pp. 163-170.
140. J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A.S. Tomkins, The web as a graph: Measurements, models, and methods, Comput Combinatorics 1627 (1999), 1-17.
141. K. Klemm and V.M. Eguíluz, Growing scale-free networks with small-world behavior Part 2, Phys Rev E (Statistical Nonlinear Soft Matter Phys) 5 (2002), art. no. 057102.
142. P.L. Krapivsky and S. Redner, Organization of growing random networks Part 2, Phys Rev E (Statistical Nonlinear Soft Matter Phys) 6 (2001), art. no. 066123.
143. P.L. Krapivsky and S. Redner, Rate equation approach for growing networks, Proc 18th Sitges Conference (Statistical Mechanics of Complex Networks), Lecture Notes in Physics 625, Springer, Berlin, 2003, pp. 3-22.
144. P.L. Krapivsky and S. Redner, Network growth by copying Part 2A, Phys Rev E (Statistical Nonlinear Soft Matter Phys) 3(2005), art. no. 036118.
145. P.L. Krapivsky, G.J. Rodgers, and S. Redner, Degree distributions of growing networks, Phys Rev Lett 86 (2001), 5401-5404.
146. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal, Stochastic models for the Web graph, Proc 41st Annual Symposium on Foundations of Computer Science, IEEE Computer Society, 2000, pp. 57-65.
147. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, Trawling the web for emerging cyber-communities, Comput Networks 31 (1999), 1481-1493.
148. J. Leskovec, L. Adamic, and B.A. Huberman, The dynamics of viral marketing, Proc 7th ACM Conference on Electronic Commerce, ACM Press, 2006, pp. 228-237.
149. J. Leskovec and C. Faloutsos, Sampling from large graphs, Proc 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, 2006, pp. 631-636.
150. J. Leskovec, J. Kleinberg, and C. Faloutsos, Graphs over time: Densification laws, shrinking diameters and possible explanations, Proc 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2005), ACM Press, 2005, pp. 177-187.
151. L. Li, D. Alderson, J.C. Doyle, and W. Willinger, Towards a theory of scale-free graphs: Definition, properties, and implications, Internet Math 2 (2006), 431-523.
152. L. Li, D. Alderson, W. Willinger, and J. Doyle, A first-principles approach to understanding the Internet's router-level topology, Comput Commun Rev 34 (2004), 3-14.
153. D. Liben-Nowell and J. Kleinberg, The link prediction problem for social networks, Proc 12th International Conference on Information and Knowledge Management, ACM Press, 2003, pp. 556-559.
154. T. Luczak, Random trees and random graphs, Random Struct Algorithms 13 (1998), 485-500.
155. S.A. Macskassy and F. Provost, A brief survey of machine learning methods for classification in networked data and an application to suspicion scoring, Presented at Workshop on Statistical Network Analysis: Models, Issues, and New Directions, http://www.research.rutgers.edu/~sofmac/paper/sna2006/macskassy- sna2006.pdf, 2006.
156. H.M. Mahmoud, Distances in plane-oriented recursive trees, Comput Appl Math 41 (1992), 237-245.
157. S. Maslov, K. Sneppen, and A. Zaliznyak, Detection of topological patterns in complex networks: Correlation profile of the Internet, Phys A: Statistical Theor Phys 333 (2004), 529-540.
158. F. Menczer, Evolution of document networks, Proc Nat Acad Sci USA 101 Supplement 1 (2004), 5261-5265.
159. R. MiIo, 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.
160. M. Mitzenmacher, A brief history of generative models for power law and lognormal distributions, Internet Math 1(2004), 226-251.
161. M. Mitzenmacher, The future of power-law research, Internet Math 2 (2006), 525-534.
162. [ 162] M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Struct Algorithms 6 (1995), 161-179.
163. M. Molloy and B. Reed, The size of the giant component of a random graph with a given degree sequence, Combin Probab Comput 7 (1998), 295-305.
164. C. Moore and M.E.J Newman, Exact solution of site and bond percolation on small-world networks Part B, Phys Rev E (Statistical Phys Plasmas Fluids Related Interdisciplinary Topics) 62 (2000), 7059-7064.
165. M.E.J. Newman, Network theory, webpage. http://www-personal.umich.edu/ ~mejn/courses/2005/cscs535/index.html.
166. M.E.J. Newman, Clustering and preferential attachment in growing networks Part 2, Phys Rev E (Statistical Nonlinear Soft Matter Phys) 2 (2001), art. no. 025102.
167. M.E.J. Newman, Properties of highly clustered networks Part 2, Phys Rev E (Statistical Nonlinear Soft Matter Phys) 2(2003), art. no. 026121.
168. M.E.J. Newman, Mixing patterns in networks Part 2, Phys Rev E (Statistical Nonlinear Soft Matter Phys) 2 (2003), art. no. 026126.
169. M.E.J. Newman, The structure and function of complex networks, SIAM Rev 45 (2003), 167-256.
170. M.E.J. Newman, Power laws, Pareto distributions and Zipf's law, Contemporary Phys 46 (2005), 323-351.
171. M.E.J. Newman, C. Moore, and D.J. Watts, Mean-field solution of the small-world network model, Phys Rev Lett 84 (2000), 3201-3204.
172. M.E.J. Newman, S.H. Strogatz, and D.J. Watts, Random graphs with arbitrary degree distributions and their applications Part 2, Phys Rev E (Statistical Nonlinear Soft Matter Physics) 2 (2001), art. no. 026118.
173. M.E.J. Newman and D.J. Watts, Renormalization group analysis of the small-world network model, Phys Lett A 263 (1999), 341-346.
174. M.E.J. Newman, D.J. Watts, and A.-L. Barábasi, The structure and dynamics of networks, Princeton University Press, Princeton, NJ, 2006.
175. Z. Nikoloski, N. Deo, and L. Kucera, Degree correlation of a scale-free random graph process, Proc 2005 European Conference on Combinatorics, Graph Theory and Applications, Assoc Discrete Math Theor Comput Sci (2005), 239-245.
176. L. Page, S. Brin, R. Motwani, and T. Winograd, The PageRank citation ranking: Bringing order to the Web, Technical Report, Digital Library Technologies Project, Stanford University, 1998.
177. E.M. Palmer, Graphical evolution, Wiley, New York, NY, 1985.
178. C.R. Palmer, RB. Gibbons, and C. Faloutsos, ANF: A fast and scalable tool for data mining in massive graphs, Proc 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, 2002, pp. 81-90.
179. D.M. Pennock, G.W. Flake, S. Lawrence, E.J. Glover, and C.L. Giles, Winners don't take all: Characterizing the competition for links on the Web, Proc Nat Acad Sci USA 99 (2002), 5207-5211.
180. C.Y. Priebe, J.M. Conroy, D.J. Marchette, and Y. Park, Scan statistics on Enron graphs, Comput Math Organization Theory 11 (2005), 229-247.
181. P. Rusmevichientong, D.M. Pennock, S. Lawrence, and C.L. Giles, Methods for sampling pages uniformly from the World Wide Web, Proc AAAI Fall Symposium on Using Uncertainty Within Computation, Technical Report FS-01-04, AAAI Press, 2001, pp. 121-128.
182. N. Sarshar, P.O. Boykin, and V.P. Roychowdhury, Percolation search in power law networks: Making unstructured peer-to-peer networks scalable, Proc 4th International Conference on Peer-to-Peer Computing, IEEE Computer Society, 2004, pp. 2-9.
183. T. Schank and D. Wagner, Approximating the clustering coefficient and transitivity, University of Karlsruhe, 2004, Germany.
184. N. Schwartz, R. Cohen, D. Ben-Avraham, A.L. Barabási, and S. Havlin, Percolation in directed scale-free networks Part 2, Phys Rev E (Statistical Nonlinear Soft Matter Phys) 1 (2002), art. no. 015104.
185. G. Szabó, M. Alava, and J. Kertész, Shortest paths and load scaling in scale-free trees Part 2, Phys Rev E (Statistical Nonlinear Soft Matter Phys) 2 (2002), art, no. 026101.
186. G. Szabó, M. Alava, and J. Kertész, Structural transitions in scale-free networks Part 2, Phys Rev E (Statistical Nonlinear Soft Matter Physics) 5 (2003), art. no. 056102.
187. G.J. Szabó, M. Alava, and J. Kertész, Geometry of minimum spanning trees in scale-free networks, Phys A 330 (2003), 31-36.
188. B. Taskar, P. Abbeel, and D. Koller, Discriminative probabilistic models for relational data, Proc 18th Conference in Uncertainty in Artificial Intelligence, Morgan Kaufmann, 2002, pp. 485-492.
189. B. Taskar, E. Segal, and D. Koller, Probabilistic classification and clustering in relational data, Proc 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), International Joint Conferences on Artificial Intelligence, 2001, pp. 870-878.
190. B. Taskar, M.F. Wong, P. Abbeel, and D. Koller, Link prediction in relational data, Proc 17th Annual Conference on Neural Information Processing Systems (NIPS 2003), MIT Press, 2004, pp. 659-666.
191. D. Towsley, Scaling, power laws, and the small world phenomena in networks, webpage. http://www-net.cs.umass.edu/cs691s/.
192. [ 192] A. Vazquez, Growing networks with local rules: Preferential attachment, clustering hierarchy and degree correlations, Phys Rev E (Statistical Nonlinear Soft Matter Phys) 67 (2003), art. no. 056104.
193. A. Vazquez, R. Pastor-Satorras, and A. Vespignani, Largescale topological and dynamical properties of the Internet Part 2, Phys Rev E (Statistical Nonlinear Soft Matter Phys) 6 (2002), art. no. 066130.
194. D.J. Watts, Networks and complexity in social systems, webpage, http://www.columbia.edu/itc/sociology/watts/w3233/.
195. D.J. Watts, Six degrees: The science of a connected age, W.W. Norton, New York, NY, 2003.
196. D.J. Watts and S.H. Strogatz, Collective dynamics of " smallworld" networks, Nature 393 (1998), 440-442.
197. H.S. Wilf, generatingfunctionology, Academic Press, Boston, 1990.
198. W. Willinger, R. Govindan, S. Jamin, V. Paxson, and S. Shenker, Scaling phenomena in the Internet: Critically examining criticality, Proc Nat Acad Sci USA 99 Supplement 1 (2002), 2573-2580.
199. J.L. Wolf, M.S. Squillante, P.S. Yu, J. Sethuraman, and L. Ozsen, Optimal crawling strategies for Web search engines, Proc 11th International Conference on World Wide Web, ACM Press, 2002, pp. 136-147.
200. N.C. Wormald, "The differential equation method for random graph processes and greedy algorithms," Lectures on approximation and randomized algorithms, M. Karonski and H.J. Promel (Editors), PWN, Warsaw, 1999, pp. 73-155.
201. S.-H. Yook, H. Jeong, and A.-L. Barabási, Modeling the Internet's large-scale topology, Proc Nat Acad Sci USA 99 (2002), 13382-13386.
202. Y. Zhang and N. Deo, Expected value of the diameter of a random graph, Congressus Numerantium 161 (2003), 211-221.