The Glauber dynamics for edge‐colorings of trees
From MaRDI portal
Publication:3386527
DOI10.1002/rsa.20960zbMath1500.05017arXiv1812.05577OpenAlexW3088015146MaRDI QIDQ3386527
Guillem Perarnau, Michelle Delcourt, Marc Heinrich
Publication date: 5 January 2021
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.05577
Trees (05C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstruction of random colourings
- Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
- Comparison theorems for reversible Markov chains
- Uniqueness of uniform random colorings of regular trees
- The Glauber dynamics of colorings on trees is rapidly mixing throughout the nonreconstruction regime
- Glauber dynamics on trees: Boundary conditions and mixing time
- Glauber dynamics on trees and hyperbolic graphs
- Systematic scan for sampling colorings
- Improved bounds for sampling colorings
- The mixing time of Glauber dynamics for coloring regular trees
- The Glauber Dynamics for Colorings of Bounded Degree Trees
- Randomly coloring sparse random graphs with fewer colors than the maximum degree
- Randomly coloring planar graphs with fewer colors than the maximum degree
- The Glauber Dynamics for Colourings of Bounded Degree Trees
- Generating uniformly distributed random latin squares
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Sampling Random Colorings of Sparse Random Graphs
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Improved Bounds for Randomly Sampling Colorings via Linear Programming
- Gibbs rapidly samples colorings of \(G(n, d/n)\)
This page was built for publication: The Glauber dynamics for edge‐colorings of trees
