A simplified proof of the FPRAS for counting perfect matchings
This paper simplifies the proof of OpenAI's FPRAS for counting perfect matchings in general graphs.
This paper provides a new, simplified proof of OpenAI's FPRAS for counting perfect matchings in general graphs, improving upon the original proof.
Before reading this…
Applications
- →Graph theory
- →Combinatorial optimization
To understand this paper, make sure you know these concepts first:
- Graph theoryfind papers →
- Combinatorial optimizationfind papers →
Abstract
More Like ThisWe give a simplified, self-contained proof of OpenAI's FPRAS for counting perfect matchings in general graphs. As in the original proof, we use a restricted Poincaré inequality for two matchings to sample weighted perfect matchings and estimate their total weight. We simplify the proof of this inequality by isolating parts of alternating cycles directly on the original vertex set and controlling the resulting error terms. This avoids the auxiliary vertices and tree constructions used in the original proof. The argument preserves the required parameter bounds and yields the same FPRAS guarantee.