Gibbs/Metropolis algorithms on a convex polytope

This paper gives sharp rates of convergence for natural versions of the Metropolis algorithm for sampling from the uniform distribution on a convex polytope. The singular proposal distribution, based on a walk moving locally in one of a fixed, finite set of directions, needs some new tools. We get useful bounds on the spectrum and eigenfunctions using Nash and Weyl-type inequalities. The top eigenvalues of the Markov chain are closely related to the Neumann eigenvalues of the polytope for a novel Laplacian.

[1]  Allan Sly,et al.  Properties of Uniform Doubly Stochastic Matrices , 2010, 1010.6136.

[2]  Santosh S. Vempala,et al.  The geometry of logconcave functions and sampling algorithms , 2007, Random Struct. Algorithms.

[3]  S. Vempala.  Hit-and-Run is Fast and Fun 1 , 2003 .

[4]  P. Diaconis,et al.  Micro-local analysis for the Metropolis algorithm , 2009 .

[5]  Tim Hesterberg,et al.  Monte Carlo Strategies in Scientific Computing , 2002, Technometrics.

[6]  Persi Diaconis,et al.  Geometric analysis for the metropolis algorithm on Lipschitz domains , 2011 .

[7]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[8]  Miklós Simonovits,et al.  Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.

[9]  S. Vempala,et al.  Hit-and-Run is Fast and Fun 1 , 2003 .

[10]  Wai Kong Yuen,et al.  Applications of geometric bounds to the convergence rate of Markov chains on Rn , 2000 .

[11]  Robert L. Smith,et al.  Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions , 1984, Oper. Res..

[12]  G. Lebeau,et al.  Semi-classical analysis of a random walk on a manifold , 2008, 0802.0644.

[13]  J. Rosenthal.  Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo , 1995 .

[14]  Persi Diaconis,et al.  What Do We Know about the Metropolis Algorithm? , 1998, J. Comput. Syst. Sci..

[15]  P. Diaconis,et al.  HIT AND RUN AS A UNIFYING DEVICE , 2007 .