Sampling Weighted Perfect Matchings on the Square-Octagon Lattice

Theoretical Computer Science, pp. 21-32, 2017.

Cited by: 0|Views2
EI

Abstract:

Perfect matchings of the square-octagon lattice, also known as “fortresses” [19], have been shown to have a rich combinatorial structure. We are interested in a natural local Markov chain for sampling from the set of perfect matchings that is known to be ergodic and has been used in practice to discover properties of random fortresses. Ho...More

Code:

Data:

Your rating :
0

 

Tags
Comments