Question

Lovasz's "Hit and Run Is Fast and Fun". In that he proved the hit run algorithm on sampling from log concave distributions on a convex set in the Euclidean space has a polynomial mixing time, hence fast.