Concentration of permanent estimators for certain large matrices

Annals of Applied Probability

Volumn 14, Issue 3, 2004, Pages 1559-1576

  Friedland, Shmuel ^a,d   Rider, Brian ^b   Zeitouni, Ofer ^c,e  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b DUKE UNIVERSITY   (United States)

^c UNIVERSITY OF MINNESOTA   (United States)

^d UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^e TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Concentration of measure; Permanent; Random matrices

Indexed keywords

EID: 26844441569     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/105051604000000396     Document Type: Article

References (15)

1. BAI, Z. D. (1997). Circular law. Ann. Probab. 25 494-529.
2. BARVINOK, A. (1999). Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor. Random Structures Algorithms 14 29-61.
3. BARVINOK, A. (2000). New permanent estimators via non-commutative determinants. Preprint. Available at www.math.lsa.umich.edu/~barvinok/det.ps.
4. CHIEN, S., RASMUSSEN, L. and SINCLAIR, A. (2002). Clifford algebras and approximating the permanent. J. Comput. System Sci. 67 263-290.
5. ERDELYI, A. (1960). Asymptotic forms for Laguerre polynomials. J. Indian Math. Soc. 24 235-250.
6. FAN, K. (1951). Maximum properties and inequalities of completely continuous operators. Proc. Natl. Acad. Sci. 37 760-766.
7. GODSIL, C. D. and GUTMAN, I. (1981). On the matching polynomial of a graph. In Algebraic Methods in Graph Theory I-II (L. Lóvasz and V. T. Sós, eds.) 67-83. North-Holland, Amsterdam.
8. GUIONNET, A. and ZEITOUNI, O. (2000). Concentration of the spectral measure for large matrices. Electron. J. Probab. 119-136.
9. JAMES, A. T. (1964). Distribution of matrix variates and latent roots derived from normal samples. Ann. Math. Statist. 35 475-501.
10. JERRUM, M., SINCLAIR, A. and VIGODA, E. (2000). A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. ECCC 79 1-21.
11. LINIAL, N., SAMORODNITSKY, A. and WIGDERSON, A. (2000). A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents. Combinatorica 20 545-568.
12. MEHTA, M. L. and NORMAND, J.-M. (1998). Probability density of the determinant of a random Hermitian matrix. J. Phys. A. 31 5377-5391.
13. SILVERSTEIN, J. W. (1985). The smallest eigenvalue of a large dimensional Wishart matrix. Ann. Probab. 13 1364-1368.
14. SZEGÖ, G. (1975). Orthogonal Polynomials, 4th ed. Amer. Math. Soc., Providence, RI.
15. VALIANT, L. G. (1979). The complexity of computing the permanent. Theoret. Comput. Sci. 8 189-201.