Approximate Counting of Matchings in Sparse Hypergraphs
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
TL;DR
This paper introduces an FPRAS for counting matchings in sparse, uniform hypergraphs, extending the canonical path method to hypergraph cases, enabling efficient approximate counting.
Contribution
It presents a novel extension of the canonical path method to hypergraphs, providing the first FPRAS for counting matchings in this class.
Findings
Provides an FPRAS for matchings in sparse hypergraphs
Extends canonical path method to hypergraph case
Enables efficient approximate counting in hypergraph matchings
Abstract
In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hypergraphs. Our method is based on a generalization of the canonical path method to the case of uniform hypergraphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Stochastic processes and statistical mechanics · Graph theory and applications