Duke Mathematical Journal

Random symmetric matrices are almost surely nonsingular

Kevin P. Costello, Terence Tao, and Van Vu

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

Let $Q_n$ denote a random symmetric ($n{\times}n)$-matrix, whose upper-diagonal entries are independent and identically distributed (i.i.d.) Bernoulli random variables (which take values $0$ and $1$ with probability $1/2$). We prove that $Q_n$ is nonsingular with probability $1-O(n^{-1/8+\delta})$ for any fixed $\delta > 0$. The proof uses a quadratic version of Littlewood-Offord-type results concerning the concentration functions of random variables and can be extended for more general models of random matrices

Article information

Source
Duke Math. J. Volume 135, Number 2 (2006), 395-413.

Dates
First available in Project Euclid: 17 October 2006

Permanent link to this document
http://projecteuclid.org/euclid.dmj/1161093270

Digital Object Identifier
doi:10.1215/S0012-7094-06-13527-5

Mathematical Reviews number (MathSciNet)
MR2267289

Zentralblatt MATH identifier
1110.15020

Subjects
Primary: 15A52
Secondary: 05D40: Probabilistic methods

Citation

Costello, Kevin P.; Tao, Terence; Vu, Van. Random symmetric matrices are almost surely nonsingular. Duke Math. J. 135 (2006), no. 2, 395--413. doi:10.1215/S0012-7094-06-13527-5. http://projecteuclid.org/euclid.dmj/1161093270.


Export citation

References

  • B. BollobáS, Random Graphs, Academic Press, New York, 1985.
  • K. Costello and V. Vu, Rank of random graphs, preprint, 2006.
  • P. ErdöS, On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc. 51 (1945), 898--902.
  • G. HaláSz, Estimates for the concentration function of combinatorial number theory and probability, Period. Math. Hungar. 8 (1977), 197--211.
  • J. Kahn, J. KomlóS, and E. SzemeréDi, On the probability that a random $\pm 1$ matrix is singular, J. Amer. Math. Soc. 8 (1995), 223--240.
  • J. KomlóS, On the determinant of $(0,1)$ matrices, Studia Sci. Math. Hungar. 2 (1967), 7--21.
  • —, On the determinant of random matrices, Studia Sci. Math. Hungar. 3 (1968), 387--399.
  • 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(54) (1943), 277--286.
  • M. Rudelson, Invertibility of random matrices: Norm of the inverse, preprint.
  • T. Tao and V. Vu, On random $\pm 1$ matrices: Singularity and determinant, Random Structures Algorithms 28 (2006), 1--23.
  • —, Inverse Littlewood-Offord theorems and the condition number of random discrete matrices, preprint.
  • —, On the singularity probability of random Bernoulli matrices, to appear in J. Amer. Math. Soc., preprint.
  • —, Additive Combinatorics, in preparation.