Positivity of hit-and-run and related algorithms

Electronic Communications in Probability

Volumn 18, Issue , 2013, Pages

  Rudolf, Daniel ^a   Ullrich, Mario ^b  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b ROMA TRE UNIVERSITY   (Italy)

Author keywords

Hit and run; Lazy; Metropolis; Positivity; Spectral gap

Indexed keywords

EID: 84879715166     PISSN: None     EISSN: 1083589X     Source Type: Journal    
DOI: 10.1214/ECP.v18-2507     Document Type: Article

References (19)

1. 5) volume algorithm for convex bodies, Random Structures Algorithms 11 (1997), no. 1, 1-50. MR-1608200
2. E. Kreyszig, Introductory functional analysis with applications, John Wiley & Sons, Inc., 1989. MR-0992618
3. G. Lawler and A. Sokal, Bounds on the L2 spectrum for Markov chains and Markov processes: a generalization of Cheeger's inequality, Trans. Amer. Math. Soc. 309 (1988), no. 2, 557-580. MR-0930082
4. J. Liu, W. Wong and A. Kong, Covariance structure and convergence rate of the Gibbs sampler with various scans, J. Roy. Statist. Soc. Ser. B 57 (1995), no. 1, 157-169. MR-1325382
5. L. Lovász, Hit-and-run mixes fast, Math. Program. 86 (1999), no. 3, Ser. A, 443-461. MR- 1733749
6. L. Lovász and M. Simonovits, Random walks in a convex body and an improved volume algorithm, Random Structures and Algorithms 4 (1993), no. 4, 359-412. MR-1238906
7. L. Lovász and S. Vempala, Fast algorithms for logconcave functions: sampling, rounding, integration and optimization, Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (Washington, DC, USA), FOCS'06, IEEE Computer Society, 2006, pp. 57-68.
8. L. Lovász Hit-and-run from a corner, SIAM J. Comput. 35 (2006), no. 4, 985-1005. MR-2203735
9. 4) volume algorithm, J. Comput. System Sci. 72 (2006), no. 2, 392-417. MR-2205290
10. L. Lovász The geometry of logconcave functions and sampling algorithms, Random Structures Algorithms 30 (2007), no. 3, 307-358. MR-2309621
11. P. Mathé and E. Novak, Simple Monte Carlo and the Metropolis algorithm, J. Complexity 23 (2007), no. 4-6, 673-696.
12. S. Meyn and R. Tweedie, Markov chains and stochastic stability, second ed., Cambridge University Press, 2009. MR-2509253
13. A. Mira and L. Tierney, Efficiency and convergence properties of slice samplers, Scand. J. Statist. 29 (2002), no. 1, 1-12. MR-1894377
14. G. Roberts and J. Rosenthal, General state space Markov chains and MCMC algorithms, Probability Surveys 1 (2004), 20-71. MR-2095565
15. D. Rudolf, Explicit error bounds for lazy reversible Markov chain Monte Carlo, J. Complexity 25 (2009), no. 1, 11-24. MR-2475305
16. Rudolf D. Explicit error bounds for Markov chain Monte Carlo, Dissertationes Math. 485 (2012), 93 pp.
17. R. Smith, Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions, Oper. Res. 32 (1984), no. 6, 1296-1308. MR-0775260
18. M. Ullrich, Rapid mixing of Swendsen-Wang and single-bond dynamics in two dimensions, ArXiv e-prints (2012).
19. M. Ullrich, Rapid mixing of Swendsen-Wang dynamics in two dimensions, Ph.D. thesis, Friedrich-Schiller-Universität Jena, Germany, 2012.