Erratum: Quasi-Random Graphs With Given Degree Sequences: (Random Structures and Algorithms (January 2008) 32:1 (1-19) DOI: 10.1002/rsa.20188);Quasi-random graphs with given degree sequences

Random Structures and Algorithms

Volumn 32, Issue 1, 2008, Pages 1-19

  Chung, Fan ^a   Graham, Ron ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Degree sequence; Graph; Quasi random

Indexed keywords

EID: 38049129887     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.25131     Document Type: Erratum

References (33)

1. W. Aiello, F. Chung, and L. Lu, "A random graph model for massive graphs," In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, New York, 2000, pp. 171-180.
2. W. Aiello, F. Chung, and L. Lu, A random graph model for power law graphs, Exp Math 10 (2001), 53-66.
3. W. Aiello, F. Chung, and L. Lu, "Random evolution in massive graphs," In Eds. J. Abello, et al., Massive Comput. 4, Kluwer Academic Publishers, 2002, pp. 97-122.
4. N. Alon and J. H. Spencer, The probabilistic method, Wiley, New York, 1992.
5. A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509-512.
6. A.-L. Barabási, R. Albert, and H. Jeong, Scale-free characteristics of random networks: The topology of the world wide web, Physica a 281 (2000), 69-77.
7. Y. Bilu and N. Linial, Lifts, discrepancy and nearly optimal spectral gap (in press).
8. B. Bollobás and V. Nikiforov, Hermitian matrices and graphs: Singular values and discrepancy, Discrete Math 285 (2004), 17-32.
9. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tompkins, and J. Wiener, "Graph Structure in the Web," In Proceedings of the WWW9 Conference, May, Amsterdam, 2000.
10. S. Butler, Using descrepancy to control singular values for nonnegative matrices, Linear Algebra Appl 419 (2006), 486-493.
11. F. Chung, Spectral graph theory, AMS Publications, 1997, xii+207 pp.
12. F. R. K. Chung, The regularity lemma for hypergraphs and quasi-randomness, Random Struct Algorithms 2 (1991), 241-252.
13. F. R. K. Chung and R. L. Graham, Cohomological aspects of hypergraphs, Trans Am Math Soc 334 (1992), 365-388.
14. F. R. K. Chung and R. L. Graham, "Maximum cuts and quasi-random graphs," In Eds. Alan Frieze and Tomasz Luczak, Random graphs, Wiley, New York, 1992, pp. 23-34.
15. F. R. K. Chung and R. L. Graham, On graphs not containing prescribed induced subgraphs, In Eds. A. Baker, et al., A tribute to Paul Erdö, Cambridge University Press, 1990, pp. 111-120.
16. F. R. K. Chung and R. L. Graham, Quasi-random hypergraphs, Random Struct Algorithms 1 (1990), 105-124.
17. F. R. K. Chung and R. L. Graham, Quasi-random set systems, J Am Math Soc 4 (1991), 151-196.
18. n, J Combin Theory (A) 61 (1992), 64-86.
19. F. R. K. Chung and R. L. Graham, Quasi-random tournaments, J Graph Theory 15 (1991), 173-198.
20. F. Chung and R. L. Graham, Sparse quasi-random graphs, Combinatorica 22 (2002), 217-244.
21. F. R. K. Chung, R. L. Graham, and R. M. Wilson, Quasi-random graphs, Combinatorica 9 (1989), 345-362.
22. F. Chung, L. Lu, T. G. Dewey, and D. J. Galas, Duplication models for biological networks, J Comput Biol 10 (2003), 677-688.
23. F. Chung, L. Lu, and V. Vu, The spectra of random graphs with given expected degrees, Proc Nat Acad Sci USA 100 (2003), 6313-6318.
24. C. Cooper and A. Frieze, A general model of undirected Web graphs, Random Struct Algorithms 22 (2003), 311-335.
25. J. Cooper, Quasirandom permutations, J Comb Theory A 106 (2004), 123-143.
26. M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the Internet topology, SIGCOMM'99 29 (1999), 251-262.
27. J. Grossman, P. Ion, and R. de Castro, Facts about Erdös numbers and the collaboration graph, http://www.oakland.edu/grossman/trivia.html.
28. H. Jeong, B. Tomber, R. Albert, Z. Oltvai, and A. L. Babárasi, The large-scale organization of metabolic networks, Nature 407 (2000), 378-382.
29. J. Kleinberg, S. R. Kumar, P. Raphavan, S. Rajagopalan, and A. Tomkins, The web as a graph: Measurements, models and methods, In Proceedings of the International Conference on Combinatorics and Computing, Tokyo, 1999.
30. M. Krivelevich and B. Sudakov, "Pseudo-random graphs," More sets, graphs and numbers, E. Gyori, G. O. H. Katona, and L. Lovász (Editors), Bolyai Soc. Math. Stud. 15, Springer, Berlin, 2006, pp. 199-266.
31. A. Thomason, "Pseudo-random graphs," In Ed. M. Karoński, Ann Discrete Math 33 (1987), 307-331. Proceedings of Random Graphs, Poznán.
32. A. Thomason, Random graphs, strongly regular graphs and pseudo-random graphs, In Ed. C. Whitehead, Survey in combinatorics, 1987; London Math Soc Lecture Note Ser 123 (1987), 173-195.
33. D. West, Introduction to graph theory, Prentice Hall, Upper Saddle River, NJ, 1996, xvi+512 p.