Approximately counting bases of bicircular matroids-Reference-Cited by-同舟云学术

Approximately counting bases of bicircular matroids

Published:2020-08-06 Issue:1 Volume:30 Page:124-135
ISSN:0963-5483
Container-title:Combinatorics, Probability and Computing
language:en
Short-container-title:Combinator. Probab. Comp.

Author:

Guo Heng,Jerrum Mark

Abstract

AbstractWe give a fully polynomial-time randomized approximation scheme (FPRAS) for the number of bases in bicircular matroids. This is a natural class of matroids for which counting bases exactly is #P-hard and yet approximate counting can be done efficiently.

Publisher

Cambridge University Press (CUP)

Subject

Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science

Reference28 articles.

1. [28] Wilson, D. B. (1996) Generating random spanning trees more quickly than the cover time. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC 1996), pp. 296–303. ACM.

2. Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs

3. Learning about critical phenomena from scribbles and sandpiles

4. Approximation algorithms for the normalizing constant of Gibbs distributions

5. Counting, Sampling and Integrating: Algorithm and Complexity

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Log-concave polynomials II: High-dimensional walks and an FPRAS for counting bases of a matroid;Annals of Mathematics;2024-01-01

2. Fundamentals of partial rejection sampling;Probability Surveys;2024-01-01

3. Perfect sampling from spatial mixing;Random Structures & Algorithms;2022-02-18