Concentration of permanent estimators for certain large matrices
arXiv:math/0407139 · doi:10.1214/105051604000000396
Abstract
Let A_n=(a_{ij})_{i,j=1}^n be an n\times n positive matrix with entries in [a,b], 0<a\le b. Let X_n=(\sqrta_{ij}x_{ij})_{i,j=1}^n be a random matrix, where {x_{ij}} are i.i.d. N(0,1) random variables. We show that for large n, \det (X_n^TX_n) concentrates sharply at the permanent of A_n, in the sense that n^{-1}\log (\det(X_n^TX_n)/perA_n)\to_{n\to\infty}0 in probability.
References in corpus (1)
Cited by in corpus (14)
- The circular law for random matrices
- Asymptotic behavior of random determinants in the Laguerre, Gram and Jacobi ensembles
- Random doubly stochastic matrices: The circular law
- Matrix permanent and quantum entanglement of permutation invariant states
- Hafnians, perfect matchings and Gaussian matrices
- Generalized Friedland-Tverberg inequality: applications and extensions
- A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs
- Approximating permanents and hafnians
- Concentration of random determinants and permanent estimators
- Pathwise asymptotic behavior of random determinants in the uniform Gram and Wishart ensembles
- On permanental polynomials of certain random matrices
- FPRAS for computing a lower bound for weighted matching polynomial of graphs
- On the least singular value of random symmetric matrices
- Computing the partition function for perfect matchings in a hypergraph