Pages that link to "Item:Q2784446"
From MaRDI portal
The following pages link to Markov chain algorithms for planar lattice structures (Q2784446):
Displaying 18 items.
- Random tilings with the GPU (Q4687699) (← links)
- Uniform sampling of<i>k</i>-hypertournaments (Q4908164) (← links)
- Rapid mixing for lattice colourings with fewer colours (Q4968808) (← links)
- Sampling biased monotonic surfaces using exponential metrics (Q4987255) (← links)
- Polynomial mixing of the edge-flip Markov chain for unbiased dyadic tilings (Q5002637) (← links)
- (Q5009549) (← links)
- Factorization in the multirefined tangent method (Q5158885) (← links)
- GENERALIZED DOMINOES TILING'S MARKOV CHAIN MIXES FAST (Q5213496) (← links)
- Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings (Q5222542) (← links)
- An upper bound on the convergence time of the Gibbs sampler in Ising models (Q5438718) (← links)
- Phase coexistence and torpid mixing in the 3-coloring model on ${\mathbb Z}^d$ (Q5499734) (← links)
- (Q5743450) (← links)
- Slow mixing of Glauber dynamics for the six-vertex model in the ordered phases (Q5875493) (← links)
- The mixing time of the Lozenge tiling Glauber dynamics (Q6047222) (← links)
- Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations (Q6202750) (← links)
- Irreducibility of recombination Markov chains in the triangular lattice (Q6202939) (← links)
- Beyond windability: approximability of the four-vertex model (Q6204549) (← links)
- Off-diagonally symmetric domino tilings of the Aztec diamond of odd order (Q6616298) (← links)
