On the randomized complexity of volume and diameter

Research output: Chapter in Book/Report/Conference proceedingConference contribution

28 Citations (Scopus)

Abstract

The authors give an O(n 7/log sup 2/n) randomised algorithm to approximate the volume of a convex body, and an O(n 6 log n) algorithm to sample a point from the uniform distribution over a convex body. For convex polytopes the algorithm runs in O(n 7/log sup 4/n) steps. Several tools are developed that may be interesting on their own. They extend results of Sinclair-Jerrum (1988) and the authors (1990) on the mixing rate of Markov chains from finite to arbitrary Markov chains. They describe an algorithm to integrate a function with respect to the stationary distribution of a general Markov chain. They 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. In several previous positive and negative results, the problem of computing the diameter of a convex body behaved similarly as the volume problem. In contrast to this, they show that there is no polynomial randomized algorithm to compute the diameter within a factor of n 1/4 .

Original languageEnglish
Title of host publicationProceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
PublisherIEEE Computer Society
Pages482-491
Number of pages10
ISBN (Electronic)0818629002
DOIs
Publication statusPublished - Jan 1 1992
Event33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 - Pittsburgh, United States
Duration: Oct 24 1992Oct 27 1992

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume1992-October
ISSN (Print)0272-5428

Conference

Conference33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
CountryUnited States
CityPittsburgh
Period10/24/9210/27/92

Fingerprint

Markov processes
Polynomials

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Lovász, L., & Simonovits, M. (1992). On the randomized complexity of volume and diameter. In Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 (pp. 482-491). [267803] (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 1992-October). IEEE Computer Society. https://doi.org/10.1109/SFCS.1992.267803

On the randomized complexity of volume and diameter. / Lovász, L.; Simonovits, M.

Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, 1992. p. 482-491 267803 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 1992-October).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lovász, L & Simonovits, M 1992, On the randomized complexity of volume and diameter. in Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992., 267803, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, vol. 1992-October, IEEE Computer Society, pp. 482-491, 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992, Pittsburgh, United States, 10/24/92. https://doi.org/10.1109/SFCS.1992.267803
Lovász L, Simonovits M. On the randomized complexity of volume and diameter. In Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society. 1992. p. 482-491. 267803. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS). https://doi.org/10.1109/SFCS.1992.267803
Lovász, L. ; Simonovits, M. / On the randomized complexity of volume and diameter. Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, 1992. pp. 482-491 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).
@inproceedings{5cef55f9801143b9b40d2b77d9b5949f,
title = "On the randomized complexity of volume and diameter",
abstract = "The authors give an O(n 7/log sup 2/n) randomised algorithm to approximate the volume of a convex body, and an O(n 6 log n) algorithm to sample a point from the uniform distribution over a convex body. For convex polytopes the algorithm runs in O(n 7/log sup 4/n) steps. Several tools are developed that may be interesting on their own. They extend results of Sinclair-Jerrum (1988) and the authors (1990) on the mixing rate of Markov chains from finite to arbitrary Markov chains. They describe an algorithm to integrate a function with respect to the stationary distribution of a general Markov chain. They 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. In several previous positive and negative results, the problem of computing the diameter of a convex body behaved similarly as the volume problem. In contrast to this, they show that there is no polynomial randomized algorithm to compute the diameter within a factor of n 1/4 .",
author = "L. Lov{\'a}sz and M. Simonovits",
year = "1992",
month = "1",
day = "1",
doi = "10.1109/SFCS.1992.267803",
language = "English",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "482--491",
booktitle = "Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992",

}

TY - GEN

T1 - On the randomized complexity of volume and diameter

AU - Lovász, L.

AU - Simonovits, M.

PY - 1992/1/1

Y1 - 1992/1/1

N2 - The authors give an O(n 7/log sup 2/n) randomised algorithm to approximate the volume of a convex body, and an O(n 6 log n) algorithm to sample a point from the uniform distribution over a convex body. For convex polytopes the algorithm runs in O(n 7/log sup 4/n) steps. Several tools are developed that may be interesting on their own. They extend results of Sinclair-Jerrum (1988) and the authors (1990) on the mixing rate of Markov chains from finite to arbitrary Markov chains. They describe an algorithm to integrate a function with respect to the stationary distribution of a general Markov chain. They 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. In several previous positive and negative results, the problem of computing the diameter of a convex body behaved similarly as the volume problem. In contrast to this, they show that there is no polynomial randomized algorithm to compute the diameter within a factor of n 1/4 .

AB - The authors give an O(n 7/log sup 2/n) randomised algorithm to approximate the volume of a convex body, and an O(n 6 log n) algorithm to sample a point from the uniform distribution over a convex body. For convex polytopes the algorithm runs in O(n 7/log sup 4/n) steps. Several tools are developed that may be interesting on their own. They extend results of Sinclair-Jerrum (1988) and the authors (1990) on the mixing rate of Markov chains from finite to arbitrary Markov chains. They describe an algorithm to integrate a function with respect to the stationary distribution of a general Markov chain. They 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. In several previous positive and negative results, the problem of computing the diameter of a convex body behaved similarly as the volume problem. In contrast to this, they show that there is no polynomial randomized algorithm to compute the diameter within a factor of n 1/4 .

UR - http://www.scopus.com/inward/record.url?scp=84990712766&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84990712766&partnerID=8YFLogxK

U2 - 10.1109/SFCS.1992.267803

DO - 10.1109/SFCS.1992.267803

M3 - Conference contribution

AN - SCOPUS:84990712766

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 482

EP - 491

BT - Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992

PB - IEEE Computer Society

ER -