Hafnians, perfect matchings and Gaussian matrices

From MaRDI portal
Publication:317488

DOI10.1214/15-AOP1036zbMATH Open1393.60009arXiv1409.3905OpenAlexW2482401181WikidataQ104523584 ScholiaQ104523584MaRDI QIDQ317488FDOQ317488

Ofer Zeitouni, Alex Samorodnitsky, Mark Rudelson

Publication date: 30 September 2016

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

Abstract: We analyze the behavior of the Barvinok estimator of the hafnian of even dimension, symmetric matrices with nonnegative entries. We introduce a condition under which the Barvinok estimator achieves subexponential errors, and show that this condition is almost optimal. Using that hafnians count the number of perfect matchings in graphs, we conclude that Barvinok's estimator gives a polynomial-time algorithm for the approximate (up to subexponential errors) evaluation of the number of perfect matchings.


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





Cites Work


Cited In (7)






This page was built for publication: Hafnians, perfect matchings and Gaussian matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q317488)