Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

### Paper:

TR05-151 | 7th December 2005 00:00

#### Metric Construction, Stopping Times and Path Coupling.

TR05-151
Authors: Magnus Bordewich, Martin Dyer, Marek Karpinski
Publication: 9th December 2005 12:00
We give illustrative applications to hypergraph independent sets and SAT instances, hypergraph colourings and colourings of bipartite graphs. In particular we prove rapid mixing for Glauber dynamics on independent sets in hypergraphs whenever the minimum edge size $m$ and degree $\Delta$ satisfy $m\geq \Delta + 2$, and for all edge sizes when $\Delta=3$. Previously rapid mixing was only known for $m\geq 2\Delta+1$. This result leads to approximation schemes for monotone SAT formulae in which the maximum number of occurrences of a variable ($\Delta$) and the minimum number of variables per clause ($m$) satisfy the same condition. For Glauber dynamics on proper colourings of 3-uniform hypergraphs we prove rapid mixing whenever the number of colours $q$ is at least $\big\lceil \tfrac{3}{2}\Delta+1 \big\rceil$. Previously the best known result was for $q\geq 1.65 \Delta$ and $\Delta\geq \Delta_0$ for some large $\Delta_0$. Finally we prove rapid mixing of scan dynamics (where the order of vertex updates is deterministic) for proper colourings of bipartite graphs whenever $q>f(\Delta)$, where $f(\Delta)\rightarrow \beta \Delta$, as $\Delta\rightarrow \infty$, and $\beta$ satisfies $\tfrac{1}{\beta}e^{1/\beta}=1,\ \ (\beta\approx 1.76)$. This gives rapid mixing with fewer colours than Vigoda's $11\Delta/6$ bound~\cite{V99}, whenever $\Delta \geq 31$, and equals this bound for $\Delta\geq 14$.