A random polynomial-time algorithm for approximating the volume of convex bodies (original) (raw)
Published: 03 January 1991 Publication History
Abstract
A randomized polynomial-time algorithm for approximating the volume of a convex body K in _n_-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 K.
References
[1]
~ALDOUS, D. Random walks on fimte groups and rapidly mixing Markov chains. In Sbmlnalre de ~Probablllt&,~{'7I, 198}-1982 Lecture Notes in Mathematics, vol. 986. Springer-Verlag, New York, ~1983, pp. 243-297,
[2]
~BARANY, I., AND FUREDI, Z. Computing the volume is difficult. In Proceed~t~gs of the 18th Annual ~AC,5! S l't>lposlum on Theory of Compttllng (Berkeley, Calif., May 28-30). ACM, New York, 1986, ~ pp. 442-447.
[3]
~BERARD, P., BESSON, G., AND GAELOT, A.S. Sur une m6galit6 isop6nm6trique qul g~nerahse celle ~de Paul Levy-Gromov. hzventzones Math 80 (1985), 295-308.
[4]
~BRODER, A. Z' How hard is it to marry at random? (On the approximation of the permanent). In ~Proceedlngs' of the 18{h Attmtal ACM Sj'tHpOXltttt,1 otl zhe Theory' of Computzng (Berkeley, Calif., ~May 28-30). ACM, New York, 1986, pp. 50-58.
[5]
~DYER, M E., AND FRIEZE, h.M. On the complexity of computing the volume of a polyhedron. ~S1AMJ Com?ut 17, 5 (Oct. 1988), 967-975.
[6]
~ELEKES, G. A geometric inequahty and the complexity of computing volume. Dtscr Comput ~Geom 1 (1986), 289-292.
[7]
~FELLER, W E. Introdzwtton to Probabthty Theot3, atzd Its Apphcatzcms 3rd ed. Wil%, New York, ~1968.
[8]
~GILBA. RG, D., AND TRUDINGER, N. S. Elll})llC Parttal DtlferetzHal Eqt~alzons o{'Second Order ~Sprmger-Verlag, New York, 1983, p. 147
[9]
~GROTSCHEL, M., LOVASZ, L.,AND SCHRIJVER, A. Geometric Algor~thmy and Combinatorial ~Optlmtzat,m Springer-Verlag, New York, 1988
[10]
~ HOEFFDING, W. Probability inequalities for sums of bounded random variables. J Am Slat ~ Assoc 58 (1963), 13-30.
[11]
~JERRUM, M R., AND SINCLAIR, A. J Conductance and the rapid mixing property for Markov ~chains: The approximation of the permanent resolved. In Ptoceedttlg~ of the 20lh Annual ACM ~~l'rnpo3lttt~ cm the Theot3, o/' Compztttng (Chicago, II1., May 2-4). ACM, New York, 1988, ~pp. 235-244.
[12]
~JERRUM, M. R., VAriANT, L. G., AND VAZIRANL V. V. Random generation of combinatorial ~structures from a uniform distribution. Theoret Cotnpzlt Sol 43 (1986), 169-188.
[13]
~KARP, R. M., AND LUBY, M. Monte Carlo algorithms for enumeratmn and reliability problems. ~In Proceedings oJ' the 24th IEEE Srrnposlum on FotmdaHons oj Computer &'zetwe IEEE, ~New York, 1983. pp. 56-64.
[14]
~Lov/~sz, L. An algorithmic theory of numbers graphs and convexity. CBMS-NSF Regional ~Conference Series on Applied Mathematics, Philadelphia, Pa., 1986.
[15]
~MILMAN, V. D., AND SCHECTMANN, O. Asymptotic theory of finite d~mensional normed spaces. ~Lecture Notes in Mathematics', vol. 1200. Springer-Verlag, New York, 1980.
[16]
~SINCLAIR, A. J., AND JERRUM, M. R. Approximate counting, uniform generation and rapidly ~mixing Markov chains. Inf Compttt. 82 (1989), 93-133.
Information & Contributors
Information
Published In
Journal of the ACM Volume 38, Issue 1
Jan. 1991
254 pages
Copyright © 1991 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 03 January 1991
Published in JACM Volume 38, Issue 1
Permissions
Request permissions for this article.
Check for updates
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations
- Downloads (Last 12 months)319
- Downloads (Last 6 weeks)45
Reflects downloads up to 13 Jan 2025
Other Metrics
Citations
- Chalkis ABachelard CFisikopoulos VTsigaridas E(2024)Randomized Control in Performance Analysis and Empirical Asset PricingSSRN Electronic Journal10.2139/ssrn.4744249Online publication date: 2024
- Ge CWooldridge MDy JNatarajan S(2024)Approximate integer solution counts over linear arithmetic constraintsProceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence and Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence and Fourteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v38i8.28640(8022-8029)Online publication date: 20-Feb-2024
- Naidu SVenkiteswaran G(2024)Optimal oversampling ratio in two-step simulationMonte Carlo Methods and Applications10.1515/mcma-2024-2011Online publication date: 3-Aug-2024
- Díaz AMorris PPerarnau GSerra O(2024)Speeding up random walk mixing by starting from a uniform vertexElectronic Journal of Probability10.1214/24-EJP109129:noneOnline publication date: 1-Jan-2024
- Chan SPak IMohar BShinkar IO'Donnell R(2024)Equality Cases of the Alexandrov–Fenchel Inequality Are Not in the Polynomial HierarchyProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649646(875-883)Online publication date: 10-Jun-2024
- Spaeh FTsourakakis CChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Markovletics: Methods and A Novel Application for Learning Continuous-Time Markov Chain MixturesProceedings of the ACM Web Conference 202410.1145/3589334.3645491(4160-4171)Online publication date: 13-May-2024
- Podgorelec VFister IVrbančič G(2024)Towards Green AI by Reducing Training Effort of Recurrent Neural Networks Using Hyper-Parameter Optimization with Dynamic Stopping Criteria2024 IEEE 22nd Jubilee International Symposium on Intelligent Systems and Informatics (SISY)10.1109/SISY62279.2024.10737555(000161-000166)Online publication date: 19-Sep-2024
- Peleg MShamai S(2024)Geometrical Bounds on the Capacity of the Binary Bipolar Input AWGN Channel2024 IEEE International Conference on Microwaves, Communications, Antennas, Biomedical Engineering and Electronic Systems (COMCAS)10.1109/COMCAS58210.2024.10666258(1-6)Online publication date: 9-Jul-2024
- Saavedra-Nieves ASaavedra-Nieves P(2024)On the estimation of the core for TU gamesExpert Systems with Applications10.1016/j.eswa.2023.123132245(123132)Online publication date: Jul-2024
- Coronado TPons JRiera G(2024)Counting Cherry Reduction Sequences in Phylogenetic Tree-Child Networks is Counting Linear ExtensionsBulletin of Mathematical Biology10.1007/s11538-024-01374-186:12Online publication date: 9-Nov-2024
- Show More Cited By
View Options
View options
View or Download as a PDF file.
eReader
View online with eReader.
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Full Access
Media
Figures
Other
Tables
Affiliations
Martin Dyer
Alan Frieze
Carnegie-Mellon Univ., Pittsburgh, PA
Ravi Kannan
Carnegie-Mellon Univ., Pittsburgh, PA