• Corpus ID: 6708898

A New Approach to Polynomial-Time Generation of Random Points in Convex Bodies

@article{Bubley1996ANA,
  title={A New Approach to Polynomial-Time Generation of Random Points in Convex Bodies},
  author={Russ Bubley and Martin E. Dyer and Mark Jerrum},
  journal={Random Structures and Algorithms},
  year={1996}
}
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 approaches have been based on estimating conductance via isoperimetric inequalities. We show that a conceptually simpler coupling argument can be used to give a similar result. 
5 Citations
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 in
Approximately counting up to four (extended abstract)
We presenta fully-polynomial scheme to approximate the number of independentsets in graphswith maximum degree four. In general, for graphswithmaximum degree A ~ 4, the scheme approximates a weighted
Path coupling: A technique for proving rapid mixing in Markov chains
  • Russ Bubley, M. Dyer
  • Mathematics
    Proceedings 38th Annual Symposium on Foundations of Computer Science
  • 1997
TLDR
A new approach to the coupling technique, which is called path coupling, for bounding mixing rates, is illustrated, which may allow coupling proofs which were previously unknown, or provide significantly better bounds than those obtained using the standard method.
Graph orientations with no sink and an approximation for a hard case of #SAT
TLDR
All of the major combinatorial problems associated with sink-free graph orientations are considered: decision, construction, listing, counting, approximate counting and approximate sampling.
CONVERGENCE RATES FORMONTE
This paper gives a brief overview of techniques developed recently for analyzing the rate of convergence to equilibrium in Markov chain Monte Carlo experiments. A number of applications in

References

SHOWING 1-10 OF 29 REFERENCES
Computing the volume of convex bodies : a case where randomness provably helps
  • M. Dyer
  • Computer Science, Mathematics
  • 1991
TLDR
The problem of computing the volume of a convex body K in R is discussed and worst-case results are reviewed and randomised approximation algorithms which show that with randomisation one can approximate very nicely are provided.
Random walks and an O*(n5) volume algorithm for convex bodies
TLDR
This work introduces three new ideas: the use of the isotropic position (or at least an approximation of it) for rounding, the separation of global obstructions and local obstructions for fast mixing, and a stepwise interlacing of rounding and sampling.
Random walks and an O * ( n 5 ) volume algorithm for convex bodies
TLDR
This algorithm introduces three new ideas: the use of the isotropic position (or at least an approximation of it) for rounding; the separation of global obstructions and local obstructions for fast mixing; and a stepwise interlacing of rounding and sampling.
Random Walks in a Convex Body and an Improved Volume Algorithm
TLDR
A randomized algorithm using O(n7 log’ n) separation calls to approximate the volume of a convex body with a fixed relative error is given and the mixing rate of Markov chains from finite to arbitrary Markov Chains is analyzed.
Markov chains and polynomial time algorithms
  • R. Kannan
  • Mathematics, Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
This paper outlines the use of rapidly mixing Markov Chains in randomized polynomial time algorithms to solve approximately certain counting problems. They fall into two classes: combinatorial
The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume
  • L. Lovász, M. Simonovits
  • Mathematics
    Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
  • 1990
TLDR
The authors generalize a bound on the mixing rate of time-reversible Markov chains in terms of their conductance by not assuming time reversibility and using a weaker notion of conductance and prove an isoperimetric inequality for subsets of a convex body.
Sampling from log-concave distributions
We consider the problem of sampling according to a distribution with log-concave density F over a convex body K R n. The sampling is done using a biassed random walk and we prove polynomial upper
Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains
TLDR
The general techniques of the paper are used to derive an almost uniform generation procedure for labelled graphs with a given degree sequence which is valid over a much wider range of degrees than previous methods: this in turn leads to randomised approximate counting algorithms for these graphs with very good asymptotic behaviour.
Coupling Methods in Probability Theory
Coupling means the joint construction of two or more random elements (variables, processes), usually in order to deduce properties of the individual elements. In this paper the method is presented
Approximating the Permanent
TLDR
A randomised approximation scheme for the permanent of a 0–1s presented, demonstrating that the matchings chain is rapidly mixing, apparently the first such result for a Markov chain with genuinely c...
...
...