Near-linear-Time Sampling of the Ferromagnetic Ising Model at the Tree Uniqueness Threshold
cs.DS
Submitted: 2026-11-03
Updated: 2026-11-03
Project page: https://kuikuiliu.github.io/files/au2023/6S891-lec11.pdf
Terminology
Sources
- A very simple proof of the LSI for high temperature spin systems
- Fast and perfect sampling of subgraphs and polymer systems
- Algorithms for the ferromagnetic Potts model on expanders
- Rapid Mixing on Random Regular Graphs beyond Uniqueness
- Rapid Mixing at the Uniqueness Threshold
- Optimal Mixing Time for the Ising Model in the Uniqueness Regime
- A Near-Linear Time Sampler for the Ising Model with External Field
- Fast algorithms at low temperatures via Markov chains
- Polymer Dynamics via Cliques: New Conditions for Approximations
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- Fisher zeros and correlation decay in the Ising model
- A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics
- Distribution of the magnetization of the critical Ising model on sparse random graphs
- Tight Sampling Bounds for Eigenvalue Approximation
- Component structure of the configuration model: barely supercritical case
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles