Approximate counting and sampling via local central limit theorems-Reference-Cited by-同舟云学术

Approximate counting and sampling via local central limit theorems

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Jain Vishesh¹,Perkins Will²,Sah Ashwin³,Sawhney Mehtaab³

Affiliation:

1. Stanford University, USA

2. University of Illinois at Chicago, USA

3. Massachusetts Institute of Technology, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3519957

Reference45 articles.

1. Improved analysis of higher order random walks and applications

2. Fractionally log-concave and sector-stable polynomials: counting planar matchings and more

3. Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model

4. Alexander Barvinok . 2016. Combinatorics and complexity of partition functions. 9 , Springer . Alexander Barvinok. 2016. Combinatorics and complexity of partition functions. 9, Springer.

5. Simple deterministic approximation algorithms for counting matchings

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

1. Parameter estimation for Gibbs distributions;ACM Transactions on Algorithms;2024-07-30

2. Towards derandomising Markov chain Monte Carlo;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Optimal mixing of the down-up walk on independent sets of a given size;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs;SIAM Journal on Computing;2023-04-26

5. Absence of zeros implies strong spatial mixing;Probability Theory and Related Fields;2023-02-03