Skip to main content
SpringerLink
Log in

Random Discrete Matrices

  • Chapter
Horizons of Combinatorics

Part of the book series: Bolyai Society Mathematical Studies ((BSMS,volume 17))

Abstract

In this survey, we discuss some basic problems concerning random matrices with discrete distributions. Several new results, tools and conjectures will be presented.

V. Vu is an A. Sloan Fellow and is supported by NSF Career Grant 0635606.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Achlioptas and F. McSherry, Fast computation of low rank matrix approximations, in: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, 611–618 (electronic), ACM, New York (2001).

    Chapter  Google Scholar 

  2. N. Alon, Eigenvalues and expanders, Combinatorica, 6 1986), 83–96.

    Article  MATH  MathSciNet  Google Scholar 

  3. N. Alon and V. Milman, λ 1, isoperimetric inequalities for graphs, and supercon-centrators, J. Combin. Theory Ser. B, 38 (1985), no. 1, 73–88.

    Article  MATH  MathSciNet  Google Scholar 

  4. N. Alon, M. Krevelevich and V. Vu, On the concentration of eigenvalues of random symmetric matrices, Israel J. Math., 131 (2002), 259–267.

    Article  MATH  MathSciNet  Google Scholar 

  5. L. Arnold, On the asymptotic distribution of the eigenvalues of random matrices, J. Math. Anal. Appl., 20 (1967), 262–268.

    Article  MATH  MathSciNet  Google Scholar 

  6. Z. D. Bai, Circular law, Ann. Probab., 25 (1997), no. 1, 494–529.

    Article  MATH  MathSciNet  Google Scholar 

  7. Z. D. Bai and J. Silverstein, Spectral analysis of large dimensional random matrices, Mathematics Monograph Series 2, Science Press (Beijing, 2006).

    Google Scholar 

  8. D. Bau and L. Trefethen, Numerical linear algebra, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (1997).

    MATH  Google Scholar 

  9. B. Bollobás, Random graphs, Second edition, Cambridge Studies in Advanced Mathematics, 73. Cambridge University Press, Cambridge (2001).

    MATH  Google Scholar 

  10. J. Bourgain, V. Vu and P. Wood, paper in preparation.

    Google Scholar 

  11. F. Chung, Spectral graph theory, CBMS series, no. 92 (1997).

    Google Scholar 

  12. F. Chung, R. Graham and R. Wilson, Quasi-random graphs, Combinatorica, 9 (1989), no. 4, 345–362.

    Article  MATH  MathSciNet  Google Scholar 

  13. F. Chung, L. Lu and V. Vu, The spectra of random graphs with expected degrees, Proceedings of National Academy of Sciences, 100, no. 11, (2003).

    Google Scholar 

  14. K. Costello and V. Vu, The ranks of random graphs, Random Structures and Algorithms, to appear.

    Google Scholar 

  15. K. Costello, T. Tao and V. Vu, Random symmetrie matrices are almost surely non-singular, Duke Math. Journal, 135, number 2 (2006), 395–413.

    Article  MATH  MathSciNet  Google Scholar 

  16. A. Edelman, Eigenvalues and condition numbers of random matrices, SIAM J. Matrix Anal. Appl., 9 (1988), no. 4, 543–560.

    Article  MATH  MathSciNet  Google Scholar 

  17. A. Edelman and B. Sutton, Tails of condition number distributions, SIAM J. Matrix Anal. Appl., 27 (2005), no. 2

    Google Scholar 

  18. P. Erdős, On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc., 51 (1945), 898–902.

    Article  MathSciNet  Google Scholar 

  19. P. Erdős, Extremal problems in number theory, 1965. Proc. Sympos. Pure Math., Vol. VIII, pp. 181–189., Amer. Math. Soc., Providence, R.I.

    Google Scholar 

  20. J. Friedman, On the second eigenvalue and random walks in random d-regular graphs, Combinatorica, 11 (1991), no. 4, 331–362

    Article  MATH  MathSciNet  Google Scholar 

  21. J. Friedman, A proof of Alon’s second eigenvalue conjecture, in: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, 720–724, ACM, New York (2003).

    Chapter  Google Scholar 

  22. J. Friedman, J. Kahn, and E. Szemere di, On the second eigenvalue in random regular graphs, Proc. of 21th ACM STOC (1989), 587–598.

    Google Scholar 

  23. Z. Füredi and J. Komlós, The eigenvalues of random symmetric matrices, Combinatorica, 1 (1981), no. 3, 233–241.

    Article  MATH  MathSciNet  Google Scholar 

  24. V. Girko, Circle law (Russian), Teor. Veroyatnost. i Primenen. 29 (1984), no. 4, 669–679.

    MATH  MathSciNet  Google Scholar 

  25. V. Girko, Theory of random determinants. Translated from the Russian. Mathematics and its Applications (Soviet Series), 45. Kluwer Academic Publishers Group, Dordrecht (1990).

    Google Scholar 

  26. F. Götze and A. N. Tikhomirov, On the circular law, preprint.

    Google Scholar 

  27. A. Guionnet and O. Zeitouni, Concentration of the spectral measure for large matrices, Electron. Comm. Probab., 5 (2000), 119–136 (electronic).

    MATH  MathSciNet  Google Scholar 

  28. G. Halász, Estimates for the concentration function of combinatorial number theory and probability, Period. Math. Hungar., 8 (1977), no. 3–4, 197–211.

    Article  MathSciNet  Google Scholar 

  29. S. Janson, The first eigenvalue of random graphs, Combin. Probab. Comput., 14 (2005), no. 5–6, 815–828.

    Article  MATH  MathSciNet  Google Scholar 

  30. J. Kahn, J. Komlós and E. Szemerédi, On the probability that a random ±1 matrix is singular, J. Amer. Math. Soc., 8 (1995), 223–240.

    Article  MATH  MathSciNet  Google Scholar 

  31. J. H. Kim and V. Vu, Sandwiching random graphs: Universality between random models, Advances in Mathematics, 188 (2004), 444–469.

    Article  MATH  MathSciNet  Google Scholar 

  32. J. Komlós, On the determinant of (0,1) matrices, Studia Sci. Math. Hungar., 2 (1967), 7–22.

    MATH  MathSciNet  Google Scholar 

  33. M. Krivelevich and B. Sudakov, The largest eigenvalue of sparse random graphs, Combin. Probab. Comput., 12 (2003), no. 1, 61–72.

    Article  MATH  MathSciNet  Google Scholar 

  34. M. Krivelevich and B. Sudakov, Pseudo-random graphs, in: More sets, graphs and numbers, 199–262, Bolyai Soc. Math. Stud., 15, Springer (Berlin, 2006).

    Google Scholar 

  35. M. Krivelevich and V. Vu, Approximating the independence number and the chromatic number in expected polynomial time, J. Comb. Optim., 6 (2002), no. 2, 143–155.

    Article  MATH  MathSciNet  Google Scholar 

  36. M. Krivelevich, B. Sudakov, V. Vu and N. Wormald, Random regular graphs of high degree, Random Structures and Algorithms, 18 (2001), no. 4, 346–363.

    Article  MATH  MathSciNet  Google Scholar 

  37. J. E. Littlewood and A. C. Offord, On the number of real roots of a random algebraic equation. III. Rec. Math. [Mat Sbornik] N.S., 12 (1943), 277–286.

    MathSciNet  Google Scholar 

  38. A. Lubotzky, R. Phillips and P. Sarnak, Ramanujan graphs, Combinatorica, 8 (1988), no. 3, 261–277.

    Article  MATH  MathSciNet  Google Scholar 

  39. G. Margulis, Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators (Russian), Problemy Peredachi Informatsii, 24 (1988), no. 1, 51–60; translation in Problems Inform. Transmission, 24 (1988), no. 1, 39–46.

    MathSciNet  Google Scholar 

  40. J. E. Littlewood and A. C. Offord, On the number of real roots of a random algebraic equation. III. Rec. Math. [Mat. Sbornik] N.S., 12 (1943), 277–286.

    MathSciNet  Google Scholar 

  41. M. L. Mehta, Random matrices, Third edition, Pure and Applied Mathematics, 142, Elsevier/Academic Press (Amsterdam, 2004).

    MATH  Google Scholar 

  42. B. McKay, The expected eigenvalue distribution of a large regular graph, Linear Algebra Appl., 40 (1981), 203–216.

    Article  MATH  MathSciNet  Google Scholar 

  43. M. Meckes, Concentration of norms and eigenvalues of random matrices, J. Funct. Anal., 211 (2004), no. 2, 508–524.

    Article  MATH  MathSciNet  Google Scholar 

  44. A. Nilli, On the second eigenvalue of a graph, Discrete Mathematics, 91 (1991), 207–210.

    Article  MATH  MathSciNet  Google Scholar 

  45. A. Nilli, Tight estimates for eigenvalues of regular graphs, Electronic J. Combinatorics, 11 (2004), N9, 4pp.

    Google Scholar 

  46. G. Pan and W. Zhou, Circular law, Extreme singular values and potential theory, preprint.

    Google Scholar 

  47. M. Rudelson, Invertibility of random matrices: Norm of the inverse, to appear in Annals of Mathematics.

    Google Scholar 

  48. A. Sárközy and E. Szemerédi, Uber ein Problem von Erdős und Moser, Acta Arithmetica, 11 (1965), 205–208.

    MATH  MathSciNet  Google Scholar 

  49. D. Spielman and S. H. Teng, Smoothed analysis of algorithms, Proceedings of the International Congress of Mathematicians, Vol. I (Beijing, 2002), 597–606, Higher Ed. Press (Beijing, 2002).

    Google Scholar 

  50. M. Rudelson and R. Vershynin, The Littlewood-Offord problem and invertibility of random matrices, preprint.

    Google Scholar 

  51. S. Peche and A. Soshnikov, Wigner random matrices with non-symmetrically distributed entries, preprint.

    Google Scholar 

  52. Y. Sinai and A. Soshnikov, A refinement of Wigner’s semicircle law in a neighborhood of the spectrum edge for random symmetrie matrices, (Russian) Funktsional. Anal. i Prilozhen., 32 (1998), no. 2, 56–79, 96; translation in Funct. Anal. Appl., 32 (1998), no. 2, 114–131.

    Article  MathSciNet  Google Scholar 

  53. A. Soshnikov and B. Sudakov, On the largest eigenvalue of a random subgraph of the hypercube, Comm. Math. Phys., 239 (2003), no. 1–2, 53–63.

    Article  MATH  MathSciNet  Google Scholar 

  54. B. Sudakov and V. Vu, Resilience of graphs, submitted.

    Google Scholar 

  55. A. Thomason, Pseudorandom graphs, Random graphs’ 85 (Poznań, 1985), 307–331, North-Holland Math. Stud., 144, North-Holland (Amsterdam, 1987).

    Google Scholar 

  56. T. Tao and V. Vu, On random 1 matrices: singularity and determinant, Random Structures Algorithms, 28 (2006), no. 1, 1–23.

    Article  MATH  MathSciNet  Google Scholar 

  57. T. Tao and V. Vu, On the singularity probability of random Bernoulli matrices, J.A.M.S., 20 (2007), no. 3, 603–628.

    Article  MATH  MathSciNet  Google Scholar 

  58. T. Tao and V. Vu, Inverse Littlewood-Offord theorems and the condition number of random matrices, to appear in Annals of Mathematics.

    Google Scholar 

  59. T. Tao and V. Vu, The condition number of a randomly perturbed matrix, STOC 2007.

    Google Scholar 

  60. T. Tao and V. Vu, Random matrices: The circular law, submitted.

    Google Scholar 

  61. T. Tao and V. Vu, Additive Combinatorics, Cambridge Univ. Press (2006).

    Google Scholar 

  62. V. Vu, Spectral Norm of Random Matrices, to appear in Combinatorica (extended abstract appeared in STOC 2005).

    Google Scholar 

  63. V. Vu and L. Wu, paper in preparation.

    Google Scholar 

  64. Wigner, On the distribution of the roots of certain symmetric matrices, Annals of Mathematics (2), 67 (1958), 325–327.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics Rutgers, Piscataway, NJ, 08854

    Van Vu

Authors
  1. Van Vu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Alfréd Rényi Inst. of Mathematics, Hungarian Academy of Sciences, Reáltanoda u. 13-15, Budapest, 1053, Hungary

    Ervin Győri , Gyula O. H. Katona  & Gábor Sági ,  & 

  2. Institute of Mathematics, Eötvös University, Pázmány Péter sétány 1/C, Budapest, 1117, Hungary

    László Lovász

Rights and permissions

Reprints and permissions

Copyright information

© 2008 János Bolyai Mathematical Society and Springer-Verlag

About this chapter

Cite this chapter

Vu, V. (2008). Random Discrete Matrices. In: Győri, E., Katona, G.O.H., Lovász, L., Sági, G. (eds) Horizons of Combinatorics. Bolyai Society Mathematical Studies, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77200-2_13

Download citation

Publish with us

Policies and ethics

Search

Navigation