Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-10T06:10:33.714Z Has data issue: false hasContentIssue false
  • English
  • Français

Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings

Part of: Discrete geometry Designs and configurations Theory of computing Markov processes

Published online by Cambridge University Press:  31 October 2018

S. CANNON ,
D. A. LEVIN  and
A. STAUFFER
S. CANNON
Affiliation:
Computer Science Division, University of California Berkeley, Berkeley, CA 94720-1776, USA (e-mail: sarah.cannon@berkeley.edu)
D. A. LEVIN
Affiliation:
Department of Mathematics, University of Oregon, Eugene, OR 97403-1222, USA (e-mail: dlevin@uoregon.edu)
A. STAUFFER
Affiliation:
Department of Mathematical Sciences, University of Bath, Claverton Down, Bath BA2 7AY, UK (e-mail: a.stauffer@bath.ac.uk)
Get access Rights & Permissions [Opens in a new window]

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 [14]. 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 ∈ ℤ⩾ 0. 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.

MSC classification

Primary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Secondary: 68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) 05B45: Tessellation and tiling problems 52C20: Tilings in $2$ dimensions
Type
Paper
Information
Combinatorics, Probability and Computing , Volume 28 , Issue 3 , May 2019 , pp. 365 - 387
Copyright
Copyright © Cambridge University Press 2018 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

†

Supported by a grant from the Simons Foundation (#361047 to Sarah Cannon) and the National Science Foundation Graduate Research Fellowship Program under grant DGE-1650044. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.

‡

Supported by a Marie Curie Career Integration Grant PCIG13-GA-2013-618588 DSRELIS, and an EPSRC Early Career Fellowship.

References

[1] Burr, M., Choi, S. W., Galehouse, B. and Yap, C. K. (2012) Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves. J. Symbol. Comput. 47 131–152.Google Scholar
[2] Cannon, S., Miracle, S. and Randall, D. (2018) Phase transitions in random dyadic tilings and rectangular dissections. SIAM J. Discrete Math. 32 1966–1992.Google Scholar
[3] Caputo, P., Martinelli, F., Sinclair, A. and Stauffer, A. (2015) Random lattice triangulations: Structure and algorithms. Ann. Appl. Probab. 25 1650–1685.Google Scholar
[4] Caputo, P., Martinelli, F., Sinclair, A. and Stauffer, A. (2016) Dynamics of lattice triangulations on thin rectangles. Electron. J. Probab. 21 29.Google Scholar
[5] Cesi, F. (2001) Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields. Probab. Theory Rel. Fields 120 569–584.Google Scholar
[6] Chen, M.-F. (1998) Trilogy of couplings and general formulas for lower bound of spectral gap. In Probability Towards 2000 (Accardi, L. and Heyde, C. C., eds), Vol. 128 of Lecture Notes in Statistics, Springer, pp. 123–136.Google Scholar
[7] Cooper, C., Dyer, M. and Greenhill, C. (2007) Sampling regular graphs and a peer-to-peer network. Combin. Probab. Comput. 16 557–593.Google Scholar
[8] Cuff, P., Ding, J., Louidor, O., Lubetzky, E., Peres, Y. and Sly, A. (2012) Glauber dynamics for the mean-field Potts model. J. Statist. Phys. 149 432–477.Google Scholar
[9] Diaconis, P. and Saloff-Coste, L. (1993) Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3 696–730.Google Scholar
[10] Ding, J., Lubetzky, E. and Peres, Y. (2009) The mixing time evolution of Glauber dynamics for the mean-field Ising model. Comm. Math. Phys. 289 725–764.Google Scholar
[11] Ding, J., Lubetzky, E. and Peres, Y. (2010) Mixing time of critical Ising model on trees is polynomial in the height. Comm. Math. Phys. 295 161–207.Google Scholar
[12] Gheissari, R. and Lubetzky, E. (2017) Mixing times of critical two-dimensional Potts models. Comm. Pure Appl. Math. 71 994–1046.Google Scholar
[13] Greenhill, C. and Sfragara, M. (2018) The switch Markov chain for sampling irregular graphs and digraphs. Theoret. Comput. Sci. 719 1–20.Google Scholar
[14] Janson, S., Randall, D. and Spencer, J. (2002) Random dyadic tilings of the unit square. Random Struct. Alg. 21 225–251.Google Scholar
[15] Lagarias, J. C., Spencer, J. H. and Vinson, J. P. (2002) Counting dyadic equipartitions of the unit square. Discrete Math. 257 481–499.Google Scholar
[16] Levin, D. A., Luczak, M. J. and Peres, Y. (2010) Glauber dynamics for the mean-field Ising model: Cut-off, critical power law, and metastability. Probab. Theory Rel. Fields 146 223–265.Google Scholar
[17] Levin, D. A., Peres, Y. and Wilmer, E. L. (2009) Markov Chains and Mixing Times, American Mathematical Society.Google Scholar
[18] Lubetzky, E. and Sly, A. (2012) Critical Ising on the square lattice mixes in polynomial time. Comm. Math. Phys. 313 815–836.Google Scholar
[19] Luby, M., Randall, D. and Sinclair, A. (2001) Markov chain algorithms for planar lattice structures. SIAM J. Comput. 31 167–192.Google Scholar
[20] Martinelli, F. (1999) Lectures on Glauber dynamics for discrete spin models. In Lectures on Probability Theory and Statistics: Ecole d'Eté de Probabilités de Saint-Flour XXVII, 1997 (Bernard, P., ed.), Springer, pp. 93–191.Google Scholar
[21] McShine, L. and Tetali, P. (1998) On the mixing time of the triangulation walk and other Catalan structures. In Randomization Methods in Algorithm Design, Vol. 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 147–160.Google Scholar
[22] Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H. and Teller, E. (1953) Equation of state calculations by fast computing machines. J. Chem. Phys. 21 1087–1092.Google Scholar
[23] Randall, D. and Tetali, P. (2000) Analyzing Glauber dynamics by comparison of Markov chains. J. Math. Phys. 41 1598–1615.Google Scholar
[24] Scott, C. and Nowak, R. D. (2006) Minimax-optimal classification with dyadic decision trees. IEEE Trans. Inform. Theory 52 1335–1353Google Scholar
[25] Stauffer, A. (2017) A Lyapunov function for Glauber dynamics on lattice triangulations. Probab. Theory Rel. Fields 169 469–521.Google Scholar