An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract)

Authors:
Martin Dyer;Leslie Ann Goldberg;Catherine Greenhill;Mark Jerrum;Michael Mitzenmacher
Affiliations:
School of Computer Studies, University of Leeds, Leeds LS2 9JT U.K.;Department of Computer Science, University of Warwick, Coventry, CV4 7AL, U.K.;School of Computer Studies, University of Leeds, Leeds LS2 9JT, U.K.;Department of Computer Science, University of Edinburgh, Edinburgh, ED9 3JZ, U.K.;Computer Science Department, Harvard University, Oxford St, Cambridge, MA
Venue:
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Year:
2000

Citing 11
Cited 1

Markov chains, computer proofs, and average-case analysis of best fit bin packing

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A very simple algorithm for estimating the number of k-colorings of a low-degree graph

Random Structures & Algorithms
Analysis of Backoff Protocols for Mulitiple AccessChannels

SIAM Journal on Computing
Analysis of practical backoff protocols for contention resolution with multiple servers

Journal of Computer and System Sciences
Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Delayed path coupling and generating random permutations via distributed stochastic processes

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Average-case analyses of first fit and random fit bin packing

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Beating the 2&Dgr; bound for approximately counting colourings: a computer-assisted proof of rapid mixing

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Analyzing Glauber Dynamics by Comparison of Markov Chains

LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Path coupling: A technique for proving rapid mixing in Markov chains

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Improved Bounds for Sampling Coloring

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

The Glauber dynamics on colourings of a graph with high girth and maximum degree

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract)

Quantified Score

Visualization

Abstract