Counting Independent Sets in Hypergraphs when Strong Spatial Mixing Fails
summary
Considers algorithms for approximately counting independent sets in hypergraphs in regimes where strong spatial mixing does not hold, focusing on the combinatorial and probabilistic structure that causes failure of strong spatial mixing and how that affects approximate counting methods such as correlation decay and Markov chain approaches.
AI-written summary · about