## Electronic Journal of Probability

### Sampling 3-colourings of regular bipartite graphs

David Galvin

#### Abstract

We show that if $G=(V,E)$ is a regular bipartite graph for which the expansion of subsets of a single parity of $V$ is reasonably good and which satisfies a certain local condition (that the union of the neighbourhoods of adjacent vertices does not contain too many pairwise non-adjacent vertices), and if $M$ is a Markov chain on the set of proper 3-colourings of $G$ which updates the colour of at most $c|V|$ vertices at each step and whose stationary distribution is uniform, then for $c < .22$ and $d$ sufficiently large the convergence to stationarity of $M$ is (essentially) exponential in $|V|$. In particular, if $G$ is the $d$-dimensional hypercube $Q_d$ (the graph on vertex set $\{0,1\}^d$ in which two strings are adjacent if they differ on exactly one coordinate) then the convergence to stationarity of the well-known Glauber (single-site update) dynamics is exponentially slow in $2^d/(\sqrt{d} \log d )$. A combinatorial corollary of our main result is that in a uniform 3-colouring of $Q_d$ there is an exponentially small probability (in $2^d$) that there is a colour $i$ such the proportion of vertices of the even subcube coloured $i$ differs from the proportion of the odd subcube coloured $i$ by at most .22. Our proof combines a conductance argument with combinatorial enumeration methods.

#### Article information

Source
Electron. J. Probab., Volume 12 (2007), paper no. 16, 481-497.

Dates
Accepted: 18 April 2007
First available in Project Euclid: 1 June 2016

https://projecteuclid.org/euclid.ejp/1464818487

Digital Object Identifier
doi:10.1214/EJP.v12-403

Mathematical Reviews number (MathSciNet)
MR2299925

Zentralblatt MATH identifier
1126.05048

Rights

#### Citation

Galvin, David. Sampling 3-colourings of regular bipartite graphs. Electron. J. Probab. 12 (2007), paper no. 16, 481--497. doi:10.1214/EJP.v12-403. https://projecteuclid.org/euclid.ejp/1464818487

#### References

• D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs. Monograph in preparation, available at http://stat-www.berkeley.edu/users/aldous/RWG/book.html.
• I. Benjamini, O. Häggström and E. Mossel. On random graph homomorphisms into Z. J. Combinatorial Th. (B) 78 no. 1 (2000), 86–114.
• B. Bollobás. Extremal Graph Theory. Academic Press, New York, 1978.
• B. Bollobás. Modern Graph Theory. Springer, New York, 1998.
• B. Bollobás. Random Graphs. Cambridge University Press, Cambridge, 2001.
• C. Borgs, J. Chayes, A. Frieze, J. Kim, P. Tetali, E. Vigoda, V. Vu. Torpid Mixing of some Monte Carlo Markov Chain algorithms in Statistical Physics. Proc. IEEE FOCS '99 218–229.
• R. Bubley and M. Dyer. Path coupling: a technique for proving rapid mixing in Markov chains. Proc. IEEE FOCS '97 223–231.
• H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statistics 23 (1952), 493–507.
• R. Diestel. Graph Theory. Springer, New York, 2005.
• M. Dyer, A. Frieze and M. Jerrum. On counting independent sets in sparse graphs. SIAM J. Comp. 31 (2002), 1527–1541.
• M. Dyer, C. Greenhill, M. Molloy. Very rapid mixing of the Glauber dynamics for proper colorings on bounded degree graphs. Random Struc. & Alg. 20 (2002), 98–114.
• D. Galvin. On homomorphisms from the Hamming cube to Z. Isr. J. Math. 138 (2003), 189–213.
• D. Galvin and D. Randall. Torpid Mixing of Local Markov Chains on 3-Colorings of the Discrete Torus. Proc. ACM–SIAM SODA '07 376–384. No
• D. Galvin and P. Tetali. Slow mixing of Glauber dynamics for the hard-core model on the Hamming cube. Random Structures & Alg. 28 (2006) 427-443.
• M. Jerrum. A very simple algorithm for estimating the number of k-colourings of a low-degree graph. Random Struc. & Alg. 7 (1995), 157–165.
• M. Jerrum and A. Sinclair. Conductance and the rapid mixing property for Markov chains: the approximation of the permanent resolved. Proc. ACM STOC '88 235–243. No
• J. Kahn. Range of cube-indexed random walk. Isreal J. Math. 124 (2001) 189–201.
• A. Korshunov and A. Sapozhenko. The number of binary codes with distance 2. Problemy Kibernet. 40 (1983), 111–130. (Russian)
• T. Åuczak and E. Vigoda. Torpid mixing of the Wang-Swendsen-KoteckÃ½ algorithm for sampling colorings. J. Discrete Alg. 3 no. 1 (2005), 92–100.
• M. Molloy. Very rapidly mixing Markov chains for 2Î"-colourings and for independent sets in a 4-regular graph. Random Struc. & Alg. 18 (2001), 101–115.
• R. Montenegro and P. Tetali. Mathematical aspects of mixing times in Markov chains. Foundations and Trends in Theoretical Computer Science 1 no. 3 (2006), 237–354.
• D. Randall. Mixing. Proc. IEEE FOCS '03 4–15.
• D. Randall. Personal communication.
• J. Salas and A. Sokal. Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem. J. Stat. Phys. 86 (1997), 551–579.
• A. Sapozhenko. On the number of connected subsets with given cardinality of the boundary in bipartite graphs. Metody Diskret. Analiz. 45 (1987), 42–70. (Russian)
• A. A. Sapozhenko. The number of antichains in ranked partially ordered sets. Diskret. Mat. 1 (1989), 74–93. (Russian; translation in Discrete Math. Appl. 1 no. 1 (1991), 35–58)
• A. Sokal. Chromatic Polynomials, Potts Models and All That. Physica A279 (2000), 324–332.
• A. Sokal. A Personal List of Unsolved Problems Concerning Lattice Gases and Antiferromagnetic Potts Models. Markov Process. Related Fields 7 (2001), 21–38.
• E. Vigoda. Improved bounds for sampling colorings. J. Math. Phys. 41 (2000), 1555–1569.