Randomly coloring simple hypergraphs
type: Item
instance of: scholarly article
title: Randomly coloring simple hypergraphs
zbMATH Open document ID: 1260.05058
author: Páll Melsted
author: Alan Frieze
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6150451
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: random colorings
zbMATH Keywords: Markov chain
zbMATH Keywords: Glauber dynamics
Wikidata QID: Q57401453
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.06.001
OpenAlex ID: W2115314646
cites work: Q4550237
cites work: A random polynomial-time algorithm for approximating the volume of convex bodies
cites work: Q3447279
cites work: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
cites work: Random walks and anO*(n5) volume algorithm for convex bodies
cites work: Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
cites work: Improved bounds for sampling colorings
DOI: 10.1016/J.IPL.2011.06.001
description: scientific article; zbMATH DE number 6150451