Sampling weighted perfect matchings on the square-octagon lattice

Prateek Bhakta, Dana Randall
2017 Theoretical Computer Science  
We consider perfect matchings of the square-octagon lattice, also known as "fortresses" [16] . There is a natural local Markov chain on the set of perfect matchings that is known to be ergodic. However, unlike Markov chains for sampling perfect matchings on the square and hexagonal lattices, corresponding to domino and lozenge tilings,
doi:10.1016/j.tcs.2017.01.014 fatcat:dxliujjjvrfz3kc6hcevgdjtwe