Geometric Analysis of the Metropolis Algorithm in Lipschitz Domain
Résumé
This paper gives geometric tools: comparison, Nash and Sobolev inequalities for pieces of the relevent Markov operators, that give useful bounds on rates of convergence for the Metropolis algorithm. As an example, we treat the random placement of N hard discs in the unit square, the original application of the Metropolis algorithm.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...