Metraipolis › archive › dc_d9943cd9a07e
Faster FPRAS for the Permanent via Restricted Poincaré Inequalities and Coupled Flows — arXiv:2608.26599
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.26599
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T19:18:53.814Z
- SHA-256 of the archived text
54ba140438e2add2ccac9eb512f5a9d790b4b5cbfc1bc926944798e7c9d7d0ed- Stable URL of this page
https://metraipolis.com/documento/dc_d9943cd9a07e
How to cite
Faster FPRAS for the Permanent via Restricted Poincaré Inequalities and Coupled Flows — arXiv:2608.26599 — arXiv (en), https://arxiv.org/abs/2608.26599 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d9943cd9a07e (Metraipolis archive dc_d9943cd9a07e, sha256 54ba140438e2add2ccac9eb512f5a9d790b4b5cbfc1bc926944798e7c9d7d0ed)
BibTeX
@misc{dcd9943cd9a07e,
title = {Faster FPRAS for the Permanent via Restricted Poincaré Inequalities and Coupled Flows — arXiv:2608.26599},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.26599},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d9943cd9a07e; sha256 54ba140438e2add2ccac9eb512f5a9d790b4b5cbfc1bc926944798e7c9d7d0ed},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.26599. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The permanent of an $n\times n$ $0/1$ matrix $A$ equals the number of perfect matchings in the bipartite graph with edges defined by $A$. Jerrum, Sinclair, and Vigoda (2004) presented an FPRAS for approximating the permanent of any nonnegative matrix using a novel simulated-annealing algorithm. The running time was improved by Bezáková, Štefankovič, Vazirani, and Vigoda (2008) to $O(n^7\log^4 n)$ for $0/1$ matrices, for any fixed approximation and success parameters. We present the first asymptotic improvement over this running time bound, obtaining an $O(n^6\log^5 n)$-time algorithm. As in the previous works, our algorithm extends to arbitrary nonnegative matrices. The analysis of Bezáková et al. yields an $O(n^4)$ relaxation time bound for the JSV Markov chain on perfect and near-perfect matchings with ideal hole weights, under which each hole pattern (the unmatched vertices, if any) is equally likely in the stationary distribution. We introduce a restricted Poincaré inequality for the partition into hole patterns and prove an $O(n^3)$ bound on the corresponding restricted relaxation time. Our proof uses a coupled multicommodity flow argument inspired by a recent transport-flow argument of Chen et al.~(2025) for the Jerrum-Sinclair chain on all matchings. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-28 in cs.DS). Categorie arXiv: Discrete Mathematics (cs.DM) ; Data Structures and Algorithms (cs.DS); Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2608.26599 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T19:16:36.843Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).