当前位置:
X-MOL 学术
›
Adv. Appl. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs
Advances in Applied Mathematics ( IF 1.0 ) Pub Date : 2021-07-29 , DOI: 10.1016/j.aam.2021.102247 Persi Diaconis 1 , Brett Kolesnik 2
中文翻译:
用于估计二部图中完美匹配数的随机顺序重要性采样
更新日期:2021-07-29
Advances in Applied Mathematics ( IF 1.0 ) Pub Date : 2021-07-29 , DOI: 10.1016/j.aam.2021.102247 Persi Diaconis 1 , Brett Kolesnik 2
Affiliation
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.
中文翻译:
用于估计二部图中完美匹配数的随机顺序重要性采样
我们介绍并研究了用于估计二部图中完美匹配数量的随机顺序重要性采样算法。在分析它们的性能时,我们建立了各种非标准的中心极限定理。我们希望我们的方法对其他应用问题有用。