Concentration of random determinants and permanent estimators

SIAM Journal on Discrete Mathematics

Volumn 23, Issue 3, 2009, Pages 1356-1371

  Costello, Kevin P ^a   Vu, Van ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Determinant; Random matrix; Singular values

Indexed keywords

ABSOLUTE VALUES; APPROXIMATION RATIOS; CONCENTRATION OF; HIGH PROBABILITY; MATRIX; POSITIVE MATRICES; RANDOM MATRIX; SINGULAR VALUES;

POLYNOMIAL APPROXIMATION;

MATRIX ALGEBRA;

EID: 73249130547     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/080733784     Document Type: Article

References (19)

1. M. AlZENMAN, F. GERMINET, A, KLEIN, AND S. WARZEL, On Bernoulli decompositions for random variables, concentration bounds, and spectral localization, Probab. Theory Related Fields, 143 (2009), pp. 219-238.
2. N. ALON, M. KRIVELEVICH, AND V. VU, On the concentration of eigenvalues of random symmetric matrices, Israel J. Math., 131 (2002), pp. 259-267.
3. Z. D. BAI, Circular law, Ann. Probab., 25 (1997), pp. 494-529.
4. A. BARVINOK, Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor, Random Structures Algorithms, 14 (1999), pp. 29-61.
5. S. FRIEDLAND, B. RIDER, AND O. ZEITOUNI, Concentration of permanent estimators for certain large matrices, Ann. Appl. Probab., 14 (2004), pp. 1559-1576.
6. V. L. GIRKO, A refinement of the central limit theorem for random determinants, Teor. Veroyatnost. i Primenen, 42 (1997), pp. 63-73; translation in Theory Probab. Appl., 42 (1998), pp. 121-129.
7. C. GODSIL AND I. GUTMAN, On the matching polynomial of a graph, in Algebraic Methods in Graph Theory, Vol. I, II (Szeged, 1978), North-Holland, Amsterdam-New York, 1981, pp. 241-249.
8. A. GUIONNET AND O. ZEITOUNI, Concentration of the spectral measure for large matrices, Electron. Comm. Probab., 5 (2000), pp. 119-136.
9. R. HORN AND C. JOHNSON, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.
10. M. JERRUM AND A. SINCLAIR, Approximating the permanent, SIAM J. Comput., 18 (1989), pp. 1149-1178.
11. M. JERRUM, A. SINCLAIR, AND E. VIGODA, A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries, J. A CM, 51 (2004), pp. 671-697.
12. J. KOMLÓS, On the determinant of (0, 1) matrices, Studia Sci. Math. Hungar., 3 (1967), pp. 7-22.
13. M. RUDELSON, Invertibility of random matrices: Norm of the inverse, Ann. of Math. (2), 168 (2008), pp. 575-600.
14. M. TALAGRAND, A new look at independence, Ann. Probab., 1 (1996), pp. 1-34.
15. T. TAO AND V. H. VU, Inverse Littlewood-Offord theorems and the condition number of random discrete matrices, Ann. of Math. (2), 169 (2009), pp. 595-632.
16. T. TAO AND V. VU, Random matrices: The circular law, Commun. Contemp. Math., 10 (2008), pp. 261-307.
17. T. TAO AND V. VU, On random ±1 matrices: Singularity and determinant, Random Structures Algorithms, 28 (2006), pp. 1-23.
18. T. TAO AND V. VU, On the condition number of a randomly perturbed matrix, in Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, San Diego, CA, ACM, New York, 2007, pp. 248-255.
19. T. TAO AND V. VU, Random matrices: Universality of ESD and the circular law,preprint available online at arXiv:0807.4898.