Concentration of permanent estimators for certain large matrices.

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

Shmuel Friedland, Ofer Zeitouni, Brian Rider

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 matricesconcentration of measure

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Determinants, permanents, traces, other special matrix functions (15A15) Random matrices (algebraic aspects) (15B52)

Related Items

A general law of large permanent, Hafnians, perfect matchings and Gaussian matrices, Singular values of Gaussian matrices and permanent estimators, Random doubly stochastic matrices: the circular law, Approximating permanents and hafnians, The circular law for random matrices, Computing the Partition Function for Perfect Matchings in a Hypergraph, Matrix permanent and quantum entanglement of permutation invariant states, An algorithmic proof of Brégman–Minc theorem

Cites Work

• 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
• Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
• 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