License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2018.57
URN: urn:nbn:de:0030-drops-94618
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9461/
Go to the corresponding LIPIcs Volume Portal

Vardi, Shai

Randomly Coloring Graphs of Logarithmically Bounded Pathwidth

pdf-format:
LIPIcs-APPROX-RANDOM-2018-57.pdf (0.5 MB)

Abstract

We consider the problem of sampling a proper k-coloring of a graph of maximal degree Delta uniformly at random. We describe a new Markov chain for sampling colorings, and show that it mixes rapidly on graphs of logarithmically bounded pathwidth if k >=(1+epsilon)Delta, for any epsilon>0, using a hybrid paths argument.

BibTeX - Entry

@InProceedings{vardi:LIPIcs:2018:9461,
  author =	{Shai Vardi},
  title =	{{Randomly Coloring Graphs of Logarithmically Bounded Pathwidth}},
  booktitle =	{Approximation, Randomization, and Combinatorial  Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
  pages =	{57:1--57:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-085-9},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{116},
  editor =	{Eric Blais and Klaus Jansen and Jos{\'e} D. P. Rolim and David Steurer},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9461},
  URN =		{urn:nbn:de:0030-drops-94618},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2018.57},
  annote =	{Keywords: Random coloring, Glauber dynamics, Markov-chain Monte Carlo}
}

Keywords: Random coloring, Glauber dynamics, Markov-chain Monte Carlo
Collection: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)
Issue Date: 2018
Date of publication: 13.08.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI