  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.
