# Mixing time of Markov chains for the 1-2 model

@article{Li2017MixingTO, title={Mixing time of Markov chains for the 1-2 model}, author={Zhongyang Li}, journal={arXiv: Probability}, year={2017} }

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.

One Citation

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 24 REFERENCES

Lower bounds for covering times for reversible Markov chains and random walks on graphs

- Computer Science, Mathematics
- 1989

1041