Approximating permanents and hafnians

  title={Approximating permanents and hafnians},
  author={Alexander I. Barvinok},
  journal={arXiv: Combinatorics},
  • A. Barvinok
  • Published 27 January 2016
  • Mathematics, Computer Science
  • arXiv: Combinatorics
We prove that the logarithm of the permanent of an nxn real matrix A and the logarithm of the hafnian of a 2nx2n real symmetric matrix A can be approximated within an additive error 1 > epsilon > 0 by a polynomial p in the entries of A of degree O(ln n - ln epsilon) provided the entries a_ij of A satisfy delta 0, fixed in advance. Moreover, the polynomial p can be computed in n^{O(ln n - ln epsilon)} time. We also improve bounds for approximating ln per A, ln haf A and logarithms of multi… 

Computing permanents of complex diagonally dominant matrices and tensors

  • A. Barvinok
  • Mathematics
    Israel Journal of Mathematics
  • 2019
We prove that for any $\lambda > 1$, fixed in advance, the permanent of an $n \times n$ complex matrix, where the absolute value of each diagonal entry is at least $\lambda$ times bigger than the sum

Approximating the Permanent of a Random Matrix with Vanishing Mean

  • Lior EldarS. Mehraban
  • Computer Science, Mathematics
    2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2018
A quasi-polynomial time deterministic algorithm for approximating the permanent of a typical n × n random matrix with unit variance and vanishing mean µ to within inverse polynomial multiplicative error to counter the common intuition that the difficulty of computing the permanent stems merely from the authors' inability to treat matrices with many opposing signs.

A Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer

This work introduces new and simple algorithms for the calculation of the number of perfect matchings of complex weighted, undirected graphs with and without loops that run in O(n3 2n/2) time, and are the fastest exact algorithms to compute these quantities.

A faster hafnian formula for complex matrices and its benchmarking on the Titan supercomputer

This work introduces new and simple algorithms for the calculation of the number of perfect matchings of complex weighted, undirected graphs with and without loops, which are the fastest exact algorithms to compute these quantities.

On a conjecture of Sokal concerning roots of the independence polynomial

It is shown that Sokal's Conjecture holds, as well as a multivariate version, and optimality for the domain of non-vanishing for independence polynomials of graphs is proved.

Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits

The condition number of a matrix implies an upper bound on the depth complexity (and therefore also on the space complexity) for this task: the determinant of Hermitian matrices with condition number $\kappa$ can be approximated to inverse polynomial relative error with classical circuits of depth.

Angle-Restricted Sets and Zero-Free Regions for the Permanent

A systematic method of constructing zero-free regions for the permanent in the sense of A, i.e. regions in the complex plane such that the permanent of a square matrix of any size with entries from this region is nonzero is given.

Spectral Independence via Stability and Applications to Holant-Type Problems

This paper formalizes connections between stability of polynomials and convergence rates of Markov Chain Monte Carlo algorithms, and obtains optimal mixing time bounds for the single-site update Markov chain known as the Glauber dynamics.

Zero-Free Regions of Partition Functions with Applications to Algorithms and Graph Limits

  • G. Regts
  • Mathematics, Computer Science
  • 2018
A class of edge-coloring models whose partition functions do not evaluate to zero on bounded degree graphs is identified and a quasi-polynomial time approximation scheme for computing these partition functions is given.



Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor

  • A. Barvinok
  • Mathematics, Computer Science
    Random Struct. Algorithms
  • 1999
We present real, complex, and quaternionic versions of a simple randomized polynomial time algorithm to approximate the permanent of a nonnegative matrix and, more generally, the mixed discriminant

A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix

Approximating permanents of complex matrices

This work presents the first approximation algorithm for the permanent of an arbi trary complex matrix, and extends the notion of an (e,6)-approximation algorithm to accommodate for cancellations in additions.

Random Gaussian matrices and Hafnian estimators

It is concluded that Barvinok's estimator gives a polynomial-time algorithm for the approximate evaluation of the number of perfect matchings in graphs.

Interlacing families II: Mixed characteristic polynomials and the Kadison{Singer problem

We use the method of interlacing polynomials introduced in our previous article to prove two theorems known to imply a positive solution to the Kadison{Singer problem. The rst is Weaver’s conjecture

Hafnians, perfect matchings and Gaussian matrices

It is concluded that Barvinok's estimator gives a polynomial-time algorithm for the approximate (up to subexponential errors) evaluation of the number of perfect matchings.

The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications

In the first part of this series we characterized all linear operators on spaces of multivariate polynomials preserving the property of being nonvanishing in products of open circular domains. For

On the Complexity of Mixed Discriminants and Related Problems

It is proved that it is #P-hard to compute the mixed discriminant of rank 2 positive semidefinite matrices and poly-time algorithms to approximate the ”beast” are presented.

An efficient tree decomposition method for permanents and mixed discriminants

Geometry of Polynomials

During the years since the first edition of this well-known monograph appeared, the subject (the geometry of the zeros of a complex polynomial) has continued to display the same outstanding vitality