I have written up a short set of notes for how to analyze the convergence of the classic ball walk algorithm for uniformly sampling from a convex body. This is based mostly on Vempala's survey on geometric random walks.

Here's the link: http://www.cs.berkeley.edu/~stephentu/writeups/random-walks.pdf