RANDOM-WALKS IN A CONVEX BODY AND AN IMPROVED VOLUME ALGORITHM

被引:247
作者
LOVASZ, L
SIMONOVITS, M
机构
[1] PRINCETON UNIV, DEPT COMP SCI, PRINCETON, NJ 08544 USA
[2] HUNGARIAN ACAD SCI, MATH RES INST, H-1053 BUDAPEST, HUNGARY
关键词
D O I
10.1002/rsa.3240040402
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We give a randomized algorithm using O(n7 log2 n) separation calls to approximate the volume of a convex body with a fixed relative error. The bound is O(n6 log4 n) for centrally symmetric bodies and for polytopes with a polynomial number of facets, and O(n5 log4 n) 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. (C) 1993 John Wiley & Sons, Inc.
引用
收藏
页码:359 / 412
页数:54
相关论文
共 45 条
[21]  
Feller W., 1968, INTRO THEORY PROBABI, V1
[22]  
Garey M.R., 1979, COMPUTERS INTRACTABI, V174
[23]  
Halmos P. R., 1974, MEASURE THEORY
[24]   RANDOM GENERATION OF COMBINATORIAL STRUCTURES FROM A UNIFORM-DISTRIBUTION [J].
JERRUM, MR ;
VALIANT, LG ;
VAZIRANI, VV .
THEORETICAL COMPUTER SCIENCE, 1986, 43 (2-3) :169-188
[25]   ON THE CONDUCTANCE OF ORDER MARKOV-CHAINS [J].
KARZANOV, A ;
KHACHIYAN, L .
ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 1991, 8 (01) :7-15
[26]  
Khachiyan L., 1993, NEW TRENDS DISCRETE, P91
[27]   THE PROBLEM OF CALCULATING THE VOLUME OF A POLYHEDRON IS ENUMERABLY HARD [J].
KHACHIYAN, LG .
RUSSIAN MATHEMATICAL SURVEYS, 1989, 44 (03) :199-200
[28]  
Khachiyan LG, 1988, IZVESTIA AJAD NAUK S, P216
[29]  
KHACHIYAN LG, IN PRESS MATH PROGRA
[30]  
LAWRENCE J, NISTIR894123 US DEP