• Publications
  • Influence
Randomized Algorithms
We have already seen some uses of randomization in the design of on line algorithms In these notes we shall describe other important illustrations of randomized algo rithms in other areas of theExpand
Path coupling: A technique for proving rapid mixing in Markov chains
  • Russ Bubley, M. Dyer
  • Mathematics, Computer Science
  • Proceedings 38th Annual Symposium on Foundations…
  • 19 October 1997
TLDR
A new approach to the coupling technique, which we call path coupling, for bounding mixing rates. Expand
Faster random generation of linear extensions
TLDR
This paper examines the problem of sampling (almost) uniformly from the set of linear extensions of a partial order, a classic problem in the theory of approximate sampling, using a slightly different Markov chain. Expand
Path Coupling, Dobrushin Uniqueness, and Approximate Counting
In this paper we illustrate new techniques for bounding the mixing rates of certain Markov chains. Whereas previous techniques have required extensive insight into the combinatorics of the problem inExpand
Graph orientations with no sink and an approximation for a hard case of #SAT
TLDR
Graph orientation problems have a long pedigree both in pure mathematics and theoretical computer science. Expand
Randomized algorithms - approximation, generation and counting
  • Russ Bubley
  • Computer Science, Mathematics
  • Distinguished dissertations
  • 1 March 2000
TLDR
Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of which are of fundamental importance to discrete mathematics and probability. Expand
Beating the 2Δ bound for approximately counting colourings: a computer-assisted proof of rapid mixing
TLDR
We consider random walks on graph colourings of an nvertex graph and disprove the conjecture that k 2 2A was a natural barrier to the mixing of colourings. Expand
On Approximately Counting Colorings of Small Degree Graphs
TLDR
We consider approximate counting of colorings of an n-vertex graph using rapidly mixing Markov chains using the method of path coupling. Expand
An elementary analysis of a procedure for sampling points in a convex body
TLDR
In this paper we describe a new method for proving the polynomial-time convergence of an algorithm for sampling almost uniformly at random from a convex body in high dimension. Expand
A New Approach to Polynomial-Time Generation of Random Points in Convex Bodies
In this paper we describe a new method for proving the polynomial-time convergence of an algorithm for sampling (almost) uniformly at random from a convex body in high dimension. Previous approachesExpand
...
1
2
...