On systematic scan for sampling H-colorings of the path
type: Item
instance of: scholarly article
title: On systematic scan for sampling H-colorings of the path
zbMATH Open document ID: 1215.68188
author: Kasper Selmar Pedersen
publication date: 2010-11-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/0706.3794
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C81
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5814180
zbMATH Keywords: systematic scan
zbMATH Keywords: block dynamics
zbMATH Keywords: mixing time
zbMATH Keywords: graph homomorphisms
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W4233831028
arXiv ID: 0706.3794
cites work: Convergence properties of the Gibbs sampler for perturbations of Gaussians
cites work: Q5501802
cites work: Non-uniqueness of measures of maximal entropy for subshifts of finite type
cites work: On Markov chains for randomly \(H\)-coloring a graph
cites work: Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review
cites work: Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
cites work: Prescribing a System of Random Variables by Conditional Distributions
cites work: On Counting Independent Sets in Sparse Graphs
cites work: Systematic scan for sampling colorings
cites work: Markov chain comparison
cites work: Q4521549
cites work: On Markov Chains for Independent Sets
cites work: The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random
cites work: Strong Spatial Mixing with Fewer Colors for Lattice Graphs
cites work: On the complexity of H-coloring
cites work: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
cites work: Glauber dynamics on trees and hyperbolic graphs
cites work: Fast convergence of the Glauber dynamics for sampling independent sets
cites work: Glauber dynamics on trees: Boundary conditions and mixing time
cites work: Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
cites work: Improved bounds for sampling colorings
cites work: Combinatorial criteria for uniqueness of Gibbs measures
cites work: Counting independent sets up to the tree threshold
DOI: 10.1002/RSA.20243
published in: Random Structures \& Algorithms
description: scientific article