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}
}
  • Zhongyang Li
  • Published 2017
  • Mathematics, Physics
  • arXiv: Probability
  • 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. 

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 24 REFERENCES
    1-2 model, dimers and clusters
    • Zhongyang Li
    • Mathematics
    • 2014
    5
    The 1-2 model
    8
    Lower bounds for covering times for reversible Markov chains and random walks on graphs
    1041
    Finite Markov Chains and Algorithmic Applications
    461
    Local Statistics of Realizable Vertex Models
    • Zhongyang Li
    • Mathematics, Physics
    • 2011
    17
    Critical surface of the 1-2 model
    6
    Markov Chains and Mixing Times
    1457
    Local statistics of lattice dimers
    182