DeepAI AI Chat
Log In Sign Up

FPRAS Approximation of the Matrix Permanent in Practice

by   James E. Newman, et al.

The matrix permanent belongs to the complexity class #P-Complete. It is generally believed to be computationally infeasible for large problem sizes, and significant research has been done on approximation algorithms for the matrix permanent. We present an implementation and detailed runtime analysis of one such Markov Chain Monte Carlo (MCMC) based Fully Polynomial Randomized Approximation Scheme (FPRAS) for the matrix permanent, which has previously only been described theoretically and with big-Oh runtime analysis. We demonstrate by analysis and experiment that the constant factors hidden by previous big-Oh analyses result in computational infeasibility.


page 1

page 2

page 3

page 4


Beyond Windability: An FPRAS for The Six-Vertex Model

The six-vertex model is an important model in statistical physics and ha...

Decayed MCMC Filtering

Filtering---estimating the state of a partially observable Markov proces...

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs

We present a polynomial-time Markov chain Monte Carlo algorithm for esti...

Scalable MCMC Sampling for Nonsymmetric Determinantal Point Processes

A determinantal point process (DPP) is an elegant model that assigns a p...

A Fast MCMC for the Uniform Sampling of Binary Matrices with Fixed Margins

Uniform sampling of binary matrix with fixed margins is an important and...

A Bounded p-norm Approximation of Max-Convolution for Sub-Quadratic Bayesian Inference on Additive Factors

Max-convolution is an important problem closely resembling standard conv...