Uniqueness of uniform random colorings of regular trees
From MaRDI portal
Publication:1613074
DOI10.1016/S0167-7152(02)00054-8zbMath1003.05043MaRDI QIDQ1613074
Publication date: 5 September 2002
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Related Items
Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree, Phase transitions in discrete structures, Reconstruction of random colourings, Randomly coloring planar graphs with fewer colors than the maximum degree, Phase transition for the mixing time of the Glauber dynamics for coloring regular trees, Correlation decay and the absence of zeros property of partition functions, Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite \(\Delta \)-regular tree for large \(\Delta \), Correlation decay and deterministic FPTAS for counting colorings of a graph, Unnamed Item, Approximating partition functions of the two-state spin system, Rigidity of proper colorings of \(\mathbb{Z}^d \), Unnamed Item, Gibbs states and the set of solutions of random constraint satisfaction problems, Left and right convergence of graphs with bounded degree, A Spectral Approach to Analysing Belief Propagation for 3-Colouring, Uniqueness for the 3-state antiferromagnetic Potts model on the tree, Glauber dynamics on trees: Boundary conditions and mixing time, \(H\)-coloring tori, Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models, Entropy-driven phase transition in low-temperature antiferromagnetic Potts models, Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs, The Glauber dynamics for edge‐colorings of trees, Mixing properties of colourings of the ℤd lattice, Local uniformity properties for glauber dynamics on graph colorings, A Simple Algorithm for Sampling Colorings of $G(n,d/n)$ Up to The Gibbs Uniqueness Threshold, Strong spatial mixing of list coloring of graphs
Cites Work
