License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2018.33
URN: urn:nbn:de:0030-drops-94371
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9437/
Go to the corresponding LIPIcs Volume Portal


Blanca, Antonio ; Galanis, Andreas ; Goldberg, Leslie Ann ; Stefankovic, Daniel ; Vigoda, Eric ; Yang, Kuan

Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs

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


Abstract

We consider the problem of sampling from the Potts model on random regular graphs. It is conjectured that sampling is possible when the temperature of the model is in the so-called uniqueness regime of the regular tree, but positive algorithmic results have been for the most part elusive. In this paper, for all integers q >= 3 and Delta >= 3, we develop algorithms that produce samples within error o(1) from the q-state Potts model on random Delta-regular graphs, whenever the temperature is in uniqueness, for both the ferromagnetic and antiferromagnetic cases. The algorithm for the antiferromagnetic Potts model is based on iteratively adding the edges of the graph and resampling a bichromatic class that contains the endpoints of the newly added edge. Key to the algorithm is how to perform the resampling step efficiently since bichromatic classes can potentially induce linear-sized components. To this end, we exploit the tree uniqueness to show that the average growth of bichromatic components is typically small, which allows us to use correlation decay algorithms for the resampling step. While the precise uniqueness threshold on the tree is not known for general values of q and Delta in the antiferromagnetic case, our algorithm works throughout uniqueness regardless of its value. In the case of the ferromagnetic Potts model, we are able to simplify the algorithm significantly by utilising the random-cluster representation of the model. In particular, we demonstrate that a percolation-type algorithm succeeds in sampling from the random-cluster model with parameters p,q on random Delta-regular graphs for all values of q >= 1 and p<p_c(q,Delta), where p_c(q,Delta) corresponds to a uniqueness threshold for the model on the Delta-regular tree. When restricted to integer values of q, this yields a simplified algorithm for the ferromagnetic Potts model on random Delta-regular graphs.

BibTeX - Entry

@InProceedings{blanca_et_al:LIPIcs:2018:9437,
  author =	{Antonio Blanca and Andreas Galanis and Leslie Ann Goldberg and Daniel Stefankovic and Eric Vigoda and Kuan Yang},
  title =	{{Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs}},
  booktitle =	{Approximation, Randomization, and Combinatorial  Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
  pages =	{33:1--33:15},
  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/9437},
  URN =		{urn:nbn:de:0030-drops-94371},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2018.33},
  annote =	{Keywords: sampling, Potts model, random regular graphs, phase transitions}
}

Keywords: sampling, Potts model, random regular graphs, phase transitions
Seminar: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)
Issue Date: 2018
Date of publication: 02.08.2018


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