## Simonovits: Random walks and an O (n 5 ) volume algorithm

- R Kannan, L Lovv
- Random Structures and Algorithms
- 1997

It is shown that the \hit-and-run" algorithm for sampling from a convex body K mixes in time O (n 2 R 2 =r 2), where R and r are the radii of the inscribed and circumscribed balls of K. Thus after appropriate preprocessing, hit-and-run produces an approximately uniformly distributed sample point in time O (n 3), which matches the best known bound for other… (More)

@inproceedings{AszHitandrunMF,
title={Hit-and-run Mixes Fast},
author={Ll Aszll O Lovv Asz}
}