• Corpus ID: 4780474

Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold

@article{Delcourt2018RapidMO,
  title={Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold},
  author={Michelle Delcourt and Guillem Perarnau and Luke Postle},
  journal={ArXiv},
  year={2018},
  volume={abs/1804.04025}
}
A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of $k$-colorings of a graph $G$ on $n$ vertices with maximum degree $\Delta$ is rapidly mixing for $k \geq \Delta +2$. In FOCS 1999, Vigoda showed rapid mixing of flip dynamics with certain flip parameters on the set of proper $k$-colorings for $k > \frac{11}{6}\Delta$, implying rapid mixing for Glauber dynamics. In this paper, we obtain the first improvement beyond the $\frac{11}{6}\Delta… 
Improved Bounds for Randomly Sampling Colorings via Linear Programming
TLDR
Two approaches are used to give two proofs that the Glauber dynamics is rapidly mixing for any $k\ge\left(\frac{11}{6} - \epsilon_0\right)\Delta$ for some absolute constant $k > 2 \Delta$.
Frozen $(\Delta+1)$-colourings of bounded degree graphs
Let $G$ be a graph of maximum degree $\Delta$ and $k$ be an integer. The $k$-recolouring graph of $G$ is the graph whose vertices are $k$-colourings of $G$ and where two $k$-colourings are adjacent
The Glauber dynamics for edges colourings of trees
TLDR
This paper shows that for k ≥ ∆ + 1 the Glauber dynamics for k-edge-colourings of T mixes in polynomial time in n, and bound on the number of colours is best possible as the chain is not even ergodic for k ≤ ∆.
A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics
TLDR
This work proposes a simple local update rule based on the Glauber dynamics that leads to efficient parallel and distributed algorithms for sampling from Gibbs distributions and can sample a uniform proper coloring with $(2+\eps)\Delta$ colors in $O(\log n) rounds, for any constant $\eps >0$.
Frozen (Δ + 1)-colourings of bounded degree graphs
TLDR
This paper shows that if G is connected, the proportion of frozen colourings of G is exponentially smaller in n than the total number of colourings, and shows that the mixing time of the Glauber dynamics for (Δ + 1)-colourings restricted to non-frozen colourings can be Ω(n2).
Weighted counting of solutions to sparse systems of equations
  • A. Barvinok, G. Regts
  • Mathematics, Computer Science
    Combinatorics, Probability and Computing
  • 2019
TLDR
An algorithm is presented which, for a set X defined by a system of homogeneous linear equations with at most r variables per equation and at most c equations per variable, computes w(X) within relative error ∊ > 0 in (rc)O(ln n-ln ∊) time.
Approximation schemes for randomly sampling colorings
Graph colouring is arguably one of the most important issues in Graph Theory. However, many of the questions that arise in the area such as the chromatic number problem or counting the number of
Reconfiguration and combinatorial games
Cette these explore des problematiques liees aux jeux. Les jeux qui nous interessent sont ceux pour lesquels il n'y a pas d'information cachee: tout les joueurs ont acces a toute l'information

References

SHOWING 1-10 OF 28 REFERENCES
The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
TLDR
It is proved that the Glauber dynamics on the C-colorings of a graph G on n vertices with girth g and maximum degree $\Delta$ mixes rapidly if (i) C=q\Delta$ and $q>q^*$, which improves the bound of roughly $1.763\ Delta$ obtained by Dyer and Frieze for the same class of graphs.
Sampling Random Colorings of Sparse Random Graphs
TLDR
This work proves rapid mixing when $k>\alpha d$ where $\alpha\approx 1.7632\ldots$ is the same constant as above and obtains $O(n^{3})$ mixing time of the Glauber dynamics, while in previous rapid mixing results the exponent was an increasing function in $d$.
The Glauber dynamics on colourings of a graph with high girth and maximum degree
(MATH) We prove that the Glauber dynamics on the C-colourings of a graph G on n vertices with girth g and maximum degree $\D$ mixes rapidly if (i) $C=q\D$ and $q>q^*$ where $q^*=1.4890... $ is the
Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors)
TLDR
A distributed sampling algorithm is given, which is called the Lazy Local Metropolis Algorithm, that achieves an optimal parallelization of this classic algorithm and improves its predecessor, the Localmetropolis algorithm of Feng, Sun and Yin, by introducing a step of distributed symmetry breaking that helps the mixing of the distributed sampling algorithms.
A general lower bound for mixing of single-site dynamics on graphs
  • Thomas P. Hayes, A. Sinclair
  • Mathematics, Computer Science
    46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
  • 2005
We prove that any Markov chain that performs local, reversible updates on randomly chosen vertices of a bounded-degree graph necessarily has mixing time at least /spl Omega/(n log n), where it is the
A non-Markovian coupling for randomly sampling colorings
  • Thomas P. Hayes, Eric Vigoda
  • Mathematics, Computer Science
    44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
  • 2003
TLDR
It is proved the Glauber dynamics is close to the uniform distribution after O(n log n) steps whenever k > (1 + /spl epsiv/)/spl Delta/, for all /Spl epsIV/ > 0.
Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings
TLDR
The first non-trivial results on when the Wang–Swendsen–Kotecký (WSK) algorithm takes exponentially long to reach the stationary distribution are proved and are thus called torpidly mixing.
Fast mixing for independent sets, colorings, and other models on trees
We study the mixing time of the Glauber dynamics for general spin systems on the regular tree, including the Ising model, the hard-core model (independent sets), and the antiferromagnetic Potts model
Coupling with the stationary distribution and improved sampling for colorings and independent sets
TLDR
An improved coupling technique for analyzing the mixing time of Markov chains is presented and a polynomial-time algorithm for sampling weighted independent sets from the Gibbs distribution of the hard-core lattice gas model is given.
Fast convergence of the Glauber dynamics for sampling independent sets
We consider the problem of sampling independent sets of a graph with maximum degree δ. The weight of each independent set is expressed in terms of a fixed positive parameter λ≤2/(δ−2), where the
...
1
2
3
...