Original article at: http://www.math.washington.edu/~ejpecp/viewarticle.php?id=1683

Sampling 3-colourings of regular bipartite graphs

David J Galvin, University of Pennsylvania

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/(log d d^(1/2)). 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.

Full text: PDF | PostScript




Copyright for articles published in this journal is retained by the authors, with first publication rights granted to the journal. By virtue of their appearance in this open access journal, articles are free to use, with proper attribution, in educational and other non-commercial settings. The authors of papers published in EJP/ECP retain the copyright. We ask for the permission to use the material in any form. We also require that the initial publication in EJP or ECP is acknowledged in any future publication of the same article. Before a paper is published in the Electronic Journal of Probability or Electronic Communications in Probability we must receive a hard-copy of the copyright form. Please mail it to Philippe Carmona Laboratoire Jean Leray UMR 6629 Universite de Nantes, 2, Rue de la Houssinière BP 92208 F-44322 Nantes Cédex 03 France You can also send it by FAX: (33|0) 2 51 12 59 12 to the attention of Philippe Carmona. You can even send a scanned jpeg or pdf of this copyright form to the managing editor ejpecpme@math.univ-nantes.fr. as an attached file. If a paper has several authors, the corresponding author signs the copyright form on behalf of all the authors.

Original article at: http://www.math.washington.edu/~ejpecp/viewarticle.php?id=1683