arXiv Analytics

Sign in

arXiv:1703.06121 [math.PR]AbstractReferencesReviewsResources

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

Zhongyang Li

Published 2017-03-17Version 1

A 1-2 model configuration is a subgraph of the hexagonal lattice satisfying the constraint that each vertex is incident to 1 or 2 edges in the subgraph. We introduce Markov chains to sample the 1-2 model configurations on finite hexagonal graphs under the uniform probability measure, and prove that the mixing time of these chains is polynomial in the size of the graphs.

Related articles: Most relevant | Search more
arXiv:math/0405157 [math.PR] (Published 2004-05-10, updated 2006-07-12)
The mixing time for simple exclusion
arXiv:0712.0489 [math.PR] (Published 2007-12-04, updated 2008-11-10)
Glauber dynamics on nonamenable graphs: Boundary conditions and mixing time
arXiv:math/0307336 [math.PR] (Published 2003-07-25)
Glauber dynamics on trees:Boundary conditions and mixing time