A random polynomial-time algorithm for approximating the volume of convex bodies

@article{Dyer1989ARP,
  title={A random polynomial-time algorithm for approximating the volume of convex bodies},
  author={Martin E. Dyer and Alan M. Frieze and Ravi Kannan},
  journal={J. ACM},
  year={1989},
  volume={38},
  pages={1-17}
}
A randomized polynomial-time algorithm for approximating the volume of a convex body <italic>K</italic> in <italic>n</italic>-dimensional Euclidean space is presented. The proof of correctness of the algorithm relies on recent theory of rapidly mixing Markov chains and isoperimetric inequalities to show that a certain random walk can be used to sample nearly uniformly from within <italic>K</italic>. 
A Random Polynomial Time Algorithm for Well-rounding Convex Bodies
TLDR
A random polynomial time algorithm for well-rounding convex bodies K that computes two simplices * and **, where ** is the blow up of * from its center by a factor of n + 3, such that Δ*K and vol (K/Δ**)≤ volK. Expand
Computing the volume of convex bodies : a case where randomness provably helps
We discuss the problem of computing the volume of a convex body K in R. We review worst-case results which show that it is hard to deterministically approximate voln K and randomised approximationExpand
A Polynomial Number of Random Points Does Not Determine the Volume of a Convex Body
  • Ronen Eldan
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 2011
We show that there is no algorithm which, provided a polynomial number of random points uniformly distributed over a convex body in ℝn, can approximate the volume of the body up to a constant factorExpand
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. Expand
Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming
TLDR
A new Markov chain algorithm is given to draw a nearly uniform sample from K to design an affine interior point algorithm that does a single random walk to solve linear programs approximately. Expand
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. Expand
Approximating the Volume of General Pfaffian Bodies
We introduce a new powerful method of approximating the volume (and integrals) of vast number of geometric bodies defined by boolean combinations of Pfaffian conditions. The method depends on theExpand
Deterministic and randomized polynomial-time approximation of radii
This paper is concerned with convex bodies in n-dimensional l p spaces, where each body is accessible only by a weak separation or optimization oracle. It studies the asymptotic relative accuracy, asExpand
A Cubic Algorithm for Computing Gaussian Volume
TLDR
Improvement comes from several aspects: better isoperimetry, smoother annealing, avoiding transformation to isotropic position and the use of the "speedy walk" in the analysis. Expand
Random walks and an O * ( n 5 ) volume algorithm for convex bodies
Given a high dimensional convex body K⊆ℝn by a separation oracle, we can approximate its volume with relative error e, using O*(n5) oracle calls. Our algorithm also brings the body into isotropicExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 34 REFERENCES
A geometric inequality and the complexity of computing volume
  • G. Elekes
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 1986
The volume of the convex hull of anym points of ann-dimensional ball with volumeV is at mostV·m/2n. This implies that no polynomial time algorithm can compute the volume of a convex set (given by anExpand
Computing the volume is difficult
TLDR
For every polynomial time algorithm which gives an upper bound\(\overline {vol}\)(K) and a lower boundvol(K) for the volume of a convex setK⊂Rd, the ratio of the upper bound to the lower bound is at least (cd/logd)d. Expand
Algorithmic theory of numbers, graphs and convexity
  • L. Lovász
  • Mathematics, Computer Science
  • CBMS-NSF regional conference series in applied mathematics
  • 1986
TLDR
How to Round Numbers Preliminaries and some Applications in Combinatorics Cuts and Joins Chromatic Number, Cliques and Perfect Graphs Minimizing a Submodular Function. Expand
On the Complexity of Computing the Volume of a Polyhedron
We show that computing the volume of a polyhedron given either as a list of facets or as a list of vertices is as hard as computing the permanent of a matrix.
Monte-Carlo algorithms for enumeration and reliability problems
  • R. Karp, M. Luby
  • Computer Science
  • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
TLDR
A simple but very general Monte-Carlo technique for the approximate solution of enumeration and reliability problems and several applications are given. Expand
Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains
The paper studies effective approximate solutions to combinatorial counting and uniform generation problems. Using a technique based on the simulation of ergodic Markov chains, it is shown that, forExpand
Probability Inequalities for sums of Bounded Random Variables
Abstract Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of SExpand
How hard is it to marry at random? (On the approximation of the permanent)
  • A. Broder
  • Computer Science, Mathematics
  • STOC '86
  • 1986
TLDR
Al though finding a perfect matching is easy and finding a Hamil tonian circuit is hard, counting perfect matchings and counting Hamiltonian circuits is equally hard, as hard as computing the number of solutions of any problem in NP. Expand
Random Generation of Combinatorial Structures from a Uniform Distribution
TLDR
It is shown that exactly uniform generation of ‘efficiently verifiable’ combinatorial structures is reducible to approximate counting (and hence, is within the third level of the polynomial hierarchy). Expand
Asymptotic Theory Of Finite Dimensional Normed Spaces
The Concentration of Measure Phenomenon in the Theory of Normed Spaces.- Preliminaries.- The Isoperimetric Inequality on Sn?1 and Some Consequences.- Finite Dimensional Normed Spaces, Preliminaries.-Expand
...
1
2
3
4
...