Spatial Mixing and Deterministic Approximate Counting of Multi-spin Systems beyond Bounded Degree GraphsResearch Paper
A multi-spin system assigns one of finitely many spins to each vertex of a graph. Each assignment receives a weight determined by local vertex preferences and interactions across edges. The sum of these weights, the partition function, is useful both as a counting quantity and as the normalizing constant of a probability distribution. Computing this sum…