Hit-and-run from a corner

SIAM Journal on Computing

Volumn 35, Issue 4, 2006, Pages 985-1005

  Lovász, László ^a   Vempala, Santosh ^b  

^a MICROSOFT RESEARCH   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Isoperimetric inequalities; Random walks; Sampling

Indexed keywords

CONVEX BODY; ISOPERIMETRIC INEQUALITIES; RANDOM WALKS;

COMBINATORIAL MATHEMATICS; PROBLEM SOLVING; SAMPLING;

RANDOM PROCESSES;

EID: 33746338452     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970544727X     Document Type: Conference Paper

References (15)

1. D. APPLEGATE AND R. KANNAN, Sampling and integration of near log-concave functions, in Proceedings of the 23rd ACM Symposium on Theory of Computing (STOC), 1991, pp. 156-163.
2. R. BUBLEY, M. DYER, AND M. JERRUM, An elementary analysis of a procedure for sampling points in a convex body, Random Structures Algorithms, 12 (1998), pp. 213-235.
3. M. E. DYER AND A. M. FRIEZE, Computing the volume of a convex body: A case where randomness provably helps, in Proceedings of the AMS Symposium on Probabilistic Combinatorics and Its Applications, 1991, pp. 123-170.
4. M. DYER, A. FRIEZE, AND R. KANNAN, A random polynomial-time algorithm for approximating the volume of convex bodies, J. Assoc. Comput. Mach., 38 (1991), pp. 1-17.
5. M. JERRUM AND A. SINCLAIR, Approximating the permanent, SIAM J. Comput., 18 (1989), pp. 1149-1178.
6. R. KANNAN AND L. LOVÁSZ, Faster mixing through average conductance, in Proceedings of the 31st ACM Symposium on Theory of Computing (STOC), 1999, pp. 282-287.
7. R. KANNAN, L. LOVÁSZ, AND M. SIMONOVITS, Isoperimetric problems for convex bodies and a localization lemma, Discrete Comput. Geom., 13 (1995) pp. 541-559.
8. 5) volume algorithm for convex bodies, Random Structures Algorithms, 11 (1997), pp. 1-50.
9. L. LOVÁSZ, How to compute the volume?, in Jber. d. Dt. Math.-Verein, Jubiläumstagung 1990, Teubner, Stuttgart, Germany, 1992, pp. 138-151.
10. L. LOVÁSZ, Hit-and-run mixes fast, Math. Program 86 (1999), pp. 443-461.
11. L. LOVÁSZ AND M. SIMONOVITS, Mixing rate of Markov chains, an isoperimetric inequality, and computing the volume, in Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, 1990, pp. 482-491.
12. L. LOVÁSZ AND M. SIMONOVITS, Random walks in a convex body and an improved volume algorithm, Random Structures Algorithms, 4 (1993), pp. 359-412.
13. L. LOVÁSZ AND S. VEMPALA, The geometry of logconcave functions and sampling algorithms, in Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS), 2003, pp. 640-649; available online at http://www-math.mit.edu/~vempala/papers/logcon.pdf.
14. 4) volume algorithm, J. Comput. System Sci. (special issue for FOCS 2003), to appear.
15. R.L. SMITH, Efficient Monte-Carlo procedures for generating points uniformly distributed over bounded regions, Oper. Res., 32 (1984), pp. 1296-1308.