Concentration of permanent estimators for certain large matrices.

DOI10.1214/105051604000000396zbMath1082.15036arXivmath/0407139MaRDI QIDQ1879920

Ofer Zeitouni, Brian Rider, Shmuel Friedland

Publication date: 15 September 2004

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0407139

zbMATH Keywords

random matrices; concentration of measure

Mathematics Subject Classification ID

60F05: Central limit and other weak theorems

15A15: Determinants, permanents, traces, other special matrix functions

15B52: Random matrices (algebraic aspects)

Related Items

An algorithmic proof of Brégman–Minc theorem, The circular law for random matrices, Computing the Partition Function for Perfect Matchings in a Hypergraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• The smallest eigenvalue of a large dimensional Wishart matrix
• Circular law
• Concentration of the spectral measure for large matrices
• Probability density of the determinant of a random Hermitian matrix
• A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
• Distributions of Matrix Variates and Latent Roots Derived from Normal Samples
• Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators
• Clifford algebras and approximating the permanent
• A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents