The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Random walks in a convex body and an improved volume algorithm
Abstract
We give a randomized algorithm using O(n7 log 2n) separation calls to approximate the volume of a convex body with a fixed relative error. The bound is O(n6 log 4n) for centrally symmpetric bodies and for polytopes with a polynomial number of facets, and O(n5 log 4n) for centrally symmetric polytopes with a polynomial number of facets. We also give an O(n6 log n) algorithm to sample a point from the uniform distribution over a convex body. Several tools are developed that may be interesting on their own. We extend results of Sinclair–Jerrum [43] and the authors [34] on the mixing rate of Markov chains from finite to arbitrary Markov chains. We also analyze the mixing rate of various random walks on convex bodies, in particular the random walk with steps from the uniform distribution over a unit ball. © 1993 John Wiley & Sons, Inc.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Rudin, W. (1973) · Cited by 13,740
Bollobás, B. (1985) · Cited by 6,196
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
Chernoff, H. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729330 · Cited by 3,550
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
Self-citationInteger Programming with a Fixed Number of Variables
Lenstra, H. W. (1983) · Mathematics of Operations Research · doi:10.1287/moor.8.4.538 · Cited by 1,440
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
Random generation of combinatorial structures from a uniform distribution
Jerrum, M. R., Valiant, L. G., & Vazirani, V. V. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90174-x · Cited by 985
λ1, Isoperimetric inequalities for graphs, and superconcentrators
Alon, N., & Milman, V. D. (1985) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(85)90092-9 · Cited by 839
An optimal Poincaré inequality for convex domains
Payne, L. E., & Weinberger, H. F. (1960) · Archive for Rational Mechanics and Analysis · doi:10.1007/bf00252910 · Cited by 700
A random polynomial-time algorithm for approximating the volume of convex bodies
Dyer, M., Frieze, A., & Kannan, R. (1991) · Journal of the ACM · doi:10.1145/102782.102783 · Cited by 693
Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
Smith, R. L. (1984) · Operations Research · doi:10.1287/opre.32.6.1296 · Cited by 531
Proceedings of Symposia in Applied Mathematics
Clemence, G. M., Birkhoff, G., & Langer, R. E. (1960) · Mathematics of Computation · doi:10.2307/2003930 · Cited by 326
On the Complexity of Computing the Volume of a Polyhedron
Dyer, M. E., & Frieze, A. M. (1988) · SIAM Journal on Computing · doi:10.1137/0217060 · Cited by 307
Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
Jerrum, M., & Sinclair, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62234 · Cited by 201
Lawrence, J. (1991) · Mathematics of Computation · doi:10.1090/s0025-5718-1991-1079024-2 · Cited by 194
The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume
Lovasz, L., & Simonovits, M. (2002) · Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89553 · Cited by 190
Self-citationHow hard is it to marry at random? (On the approximation of the permanent)
Broder, A. Z. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12136 · Cited by 173
Counting linear extensions is #P-complete
Brightwell, G., & Winkler, P. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103441 · Cited by 163
Sampling and integration of near log-concave functions
Applegate, D., & Kannan, R. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103439 · Cited by 138
A random polynomial time algorithm for approximating the volume of convex bodies
Dyer, M., & FRIEZE, A. M. (1989) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/73007.73043 · Cited by 124
Hit-and-run algorithms for the identification of nonredundant linear inequalities
Berbee, H. C. P., Boender, C. G. E., Ran, A. H. G. R., Scheffer, C. L., Smith, R. L., & Telgen, J. (1987) · Mathematical Programming · doi:10.1007/bf02591694 · Cited by 98
Complexity of Polytope Volume Computation
Khachiyan, L. (1993) · Algorithms and combinatorics · doi:10.1007/978-3-642-58043-7_5 · Cited by 54
Cited by
Local Graph Partitioning using PageRank Vectors
Andersen, R., Chung, F., & Lang, K. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.44 · Cited by 967
The Brunn-Minkowski inequality
Gardner, R. J. (2002) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-02-00941-2 · Cited by 894
Spielman, D. A., & Teng, S.-H. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007372 · Cited by 769
Some applications of Laplace eigenvalues of graphs
Mohar, B. (1997) · Graph Symmetry · doi:10.1007/978-94-015-8937-6_6 · Cited by 422
Lectures on finite Markov chains
Saloff-Coste, L. (1997) · Lecture Notes in Mathematics · doi:10.1007/bfb0092621 · Cited by 382
Metadata
- Authors
- Lovász, L., & Simonovits, M.
- Venue
- Random Structures & Algorithms
- Publisher
- Wiley
- Published
- 1993-01
- Volume
- 4
- Issue
- 4
- Pages
- 359-412
- ISSN
- 1042-9832 (ISSN-L)
- 1098-2418
- OpenAlex
- W2159000620
- Cited by
- 409
- References
- 24
- FWCI
- 12.95
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.