Rapid mixing of hypergraph independent sets

DOI10.1002/rsa.20830zbMath1417.05147arXiv1610.07999OpenAlexW3102182509MaRDI QIDQ5229340

Jonathan Hermon, Allan Sly, Yumeng Zhang

Publication date: 14 August 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.07999

zbMATH Keywords

mixing timeapproximate countinghypergraph independent sets

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Counting Solutions to Random CNF Formulas ⋮ Inapproximability of counting independent sets in linear hypergraphs ⋮ Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems ⋮ Approximation via Correlation Decay When Strong Spatial Mixing Fails ⋮ Counting Hypergraph Colorings in the Local Lemma Regime

This page was built for publication: Rapid mixing of hypergraph independent sets