Mixing time of Markov chains for the 1-2 model

2017/03/17 by Zhongyang Li, Li, Zhongyang
Computer Science · Mathematics · #Bayesian Methods and Mixture Models #FOS: Mathematics #FOS: Physical sciences #Markov Chains and Monte Carlo Methods #Mathematical Physics (math-ph) #Probability (math.PR) #Stochastic processes and statistical mechanics

paper · pdf · doi:10.48550/arxiv.1703.06121

openalex publication_date 2017/03/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A 1-2 model configuration is a subset of edges of a hexagonal lattice satisfying the constraint that each vertex is incident to 1 or 2 edges. We introduce Markov chains to sample the 1-2 model configurations on 2D hexagonal lattice and prove that the mixing time of these chains is polynomial in the sizes of the graphs for a large class of probability measures.

Related

• Mixing times of Markov chains on a cycle with additional long range\n connections
• Mixing Time on the Kagome Lattice
• Broder's Chain Is Not Rapidly Mixing
• Torpid Mixing of Markov Chains for the Six-vertex Model on ℤ²
• Mixing Time for Square Tilings