Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs
arXiv:1907.02333 · doi:10.1016/j.aam.2021.102247
Abstract
We introduce and study randomized sequential importance sampling algorithms for estimating the number of perfect matchings in bipartite graphs. In analyzing their performance, we establish various non-standard central limit theorems. We expect our methods to be useful for other applied problems.
v2: minor improvements