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 the 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
