Hafnians, perfect matchings and Gaussian matrices

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.

[1]  Ofer Zeitouni,et al.  Singular values of Gaussian matrices and permanent estimators , 2013, Random Struct. Algorithms.

[2]  Lin Yu-qing,et al.  Matching polynomial of graph , 2007 .

[3]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[4]  H. Yau,et al.  The local semicircle law for a general class of random matrices , 2012, 1212.0164.

[5]  Alex Samorodnitsky,et al.  A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents , 1998, STOC '98.

[6]  S. Szarek.  Spaces with large distance to l∞n and random matrices , 1990 .

[7]  A. Guionnet,et al.  CONCENTRATION OF THE SPECTRAL MEASURE FOR LARGE MATRICES , 2000 .

[8]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[9]  M. Rudelson,et al.  The Littlewood-Offord problem and invertibility of random matrices , 2007, math/0703503.

[10]  Shmuel Friedland,et al.  Concentration of permanent estimators for certain large matrices , 2004 .

[11]  Alex Samorodnitsky,et al.  Random weighting, asymptotic counting, and inverse isoperimetry , 2005, Electron. Colloquium Comput. Complex..

[12]  David Gamarnik,et al.  Simple deterministic approximation algorithms for counting matchings , 2007, STOC '07.

[13]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries , 2001, STOC '01.

[14]  M. Rudelson,et al.  The smallest singular value of a random rectangular matrix , 2008, 0802.3956.

[15]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[16]  Oskari Ajanki,et al.  Local semicircle law with imprimitive variance matrix , 2013, 1311.2016.

[17]  Alex Samorodnitsky,et al.  Computing the Partition Function for Perfect Matchings in a Hypergraph , 2011, Comb. Probab. Comput..

[18]  Alexander I. Barvinok,et al.  Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor , 1999, Random Struct. Algorithms.

[19]  M. Ledoux.  The concentration of measure phenomenon , 2001 .