Geometric Random Walks: a Survey

摘要: The developing theory of geometric random walks is outlined here. Three aspects—general methods for estimating convergence (the “mixing” rate), isoperimetric inequalities in R and their intimate connection to walks, algorithms fundamental problems (volume computation convex optimization) that are based on sampling by walks—are discussed.