GENERALIZED DOMINOES TILING'S MARKOV CHAIN MIXES FAST
From MaRDI portal
Publication:5213496
DOI10.14317/jami.2019.469zbMath1449.05046OpenAlexW3015822911MaRDI QIDQ5213496
No author found.
Publication date: 3 February 2020
Full work available at URL: https://www.koreascience.or.kr/article/JAKO201928462662753.page
tilingdistributive latticepartition functionsFPRASheight functiondominoesmixing time of Markov chain
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial aspects of tessellation and tiling problems (05B45) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tilings of rectangles with T-tetrominoes
- T-tetrominoes Tiling's Markov chain mixes fast
- Sampling contingency tables
- Planarity, symmetry and counting tilings
- Tiling simply connected regions with rectangles
- Dimers and amoebae
- A variational principle for domino tilings
- Markov Chain Algorithms for Planar Lattice Structures
- The statistics of dimers on a lattice
- Approximating the Permanent
- Dimer problem in statistical mechanics-an exact result
- Covering a Rectangle with T-Tetrominoes
This page was built for publication: GENERALIZED DOMINOES TILING'S MARKOV CHAIN MIXES FAST