Rapid mixing of hypergraph independent sets-Reference-Cited by-同舟云学术

Rapid mixing of hypergraph independent sets

Published:2018-11-28 Issue:4 Volume:54 Page:730-767
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct Alg

Author:

Hermon Jonathan¹,Sly Allan²³,Zhang Yumeng³

Affiliation:

1. University of CambridgeCambridge United Kingdom

2. Princeton UniversityPrinceton New Jersey

3. University of CaliforniaBerkeley California

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/rsa.20830

Reference15 articles.

1. 43rd International Colloquium on Automata Languages and Programming ICALP 2016 July 11–15 2016 Rome Italy 2016 I Bezáková A Galanis L Ann Goldberg H Guo D Štefankovič Approximation via correlation decay when strong spatial mixing fails 45:1 45:13

2. Stopping Times, Metrics and Approximate Counting

3. Path coupling using stopping times and counting independent sets and colorings in hypergraphs

4. H.Guo M.Jerrum andJ.Liu. Uniform sampling through the Lovász Local Lemma. arXiv: 1611.01647 2016.

5. Polynomial-Time Approximation Algorithms for the Ising Model

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

1. Inapproximability of counting independent sets in linear hypergraphs;Information Processing Letters;2024-02

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

3. On the zeroes of hypergraph independence polynomials;Combinatorics, Probability and Computing;2023-09-21

4. Inapproximability of Counting Hypergraph Colourings;ACM Transactions on Computation Theory;2022-12-31

5. Towards the sampling Lovász Local Lemma;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02