### Abstract

We give the first polynomial upper bound on the mixing time of the edge-flip Markov chain for unbiased dyadic tilings, resolving an open problem originally posed by Janson, Randall, and Spencer in 2002 [16]. A dyadic tiling of size n is a tiling of the unit square by n non-overlapping dyadic rectangles, each of area 1/n, where a dyadic rectangle is any rectangle that can be written in the form [a2-s, (a + 1)2-s] × [b2-t, (b + 1)2-t] for a, b, s, t 2 Z0. The edge-flip Markov chain selects a random edge of the tiling and replaces it with its perpendicular bisector if doing so yields a valid dyadic tiling. Specifically, we show that the relaxation time of the edge-flip Markov chain for dyadic tilings is at most O(n4.09), which implies that the mixing time is at most O(n5.09). We complement this by showing that the relaxation time is at least (n1.38), improving upon the previously best lower bound of (n log n) coming from the diameter of the chain.

Language | English |
---|---|

Journal | Combinatorics, Probability and Computing |

DOIs | |

Status | Accepted/In press - 1 Aug 2018 |

### Fingerprint

### Keywords

- Random dyadic tilings
- Rapid mixing
- Spectral gap

### Cite this

*Combinatorics, Probability and Computing*. https://doi.org/10.1017/S0963548318000470

**Polynomial mixing of the edge-flip markov chain for unbiased dyadic tilings.** / Cannon, Sarah; Levin, David A.; Stauffer, Alexandre.

Research output: Contribution to journal › Article

}

TY - JOUR

T1 - Polynomial mixing of the edge-flip markov chain for unbiased dyadic tilings

AU - Cannon, Sarah

AU - Levin, David A.

AU - Stauffer, Alexandre

PY - 2018/8/1

Y1 - 2018/8/1

N2 - We give the first polynomial upper bound on the mixing time of the edge-flip Markov chain for unbiased dyadic tilings, resolving an open problem originally posed by Janson, Randall, and Spencer in 2002 [16]. A dyadic tiling of size n is a tiling of the unit square by n non-overlapping dyadic rectangles, each of area 1/n, where a dyadic rectangle is any rectangle that can be written in the form [a2-s, (a + 1)2-s] × [b2-t, (b + 1)2-t] for a, b, s, t 2 Z0. The edge-flip Markov chain selects a random edge of the tiling and replaces it with its perpendicular bisector if doing so yields a valid dyadic tiling. Specifically, we show that the relaxation time of the edge-flip Markov chain for dyadic tilings is at most O(n4.09), which implies that the mixing time is at most O(n5.09). We complement this by showing that the relaxation time is at least (n1.38), improving upon the previously best lower bound of (n log n) coming from the diameter of the chain.

AB - We give the first polynomial upper bound on the mixing time of the edge-flip Markov chain for unbiased dyadic tilings, resolving an open problem originally posed by Janson, Randall, and Spencer in 2002 [16]. A dyadic tiling of size n is a tiling of the unit square by n non-overlapping dyadic rectangles, each of area 1/n, where a dyadic rectangle is any rectangle that can be written in the form [a2-s, (a + 1)2-s] × [b2-t, (b + 1)2-t] for a, b, s, t 2 Z0. The edge-flip Markov chain selects a random edge of the tiling and replaces it with its perpendicular bisector if doing so yields a valid dyadic tiling. Specifically, we show that the relaxation time of the edge-flip Markov chain for dyadic tilings is at most O(n4.09), which implies that the mixing time is at most O(n5.09). We complement this by showing that the relaxation time is at least (n1.38), improving upon the previously best lower bound of (n log n) coming from the diameter of the chain.

KW - Random dyadic tilings

KW - Rapid mixing

KW - Spectral gap

U2 - 10.1017/S0963548318000470

DO - 10.1017/S0963548318000470

M3 - Article

JO - Combinatorics, Probability and Computing

T2 - Combinatorics, Probability and Computing

JF - Combinatorics, Probability and Computing

SN - 0963-5483

ER -