Optimal metropolis algorithms for product measures on the vertices of a hypercube
From MaRDI portal
Publication:4385260
DOI10.1080/17442509808834136zbMath0904.60021OpenAlexW2041249051MaRDI QIDQ4385260
Publication date: 18 January 1999
Published in: Stochastics and Stochastic Reports (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/17442509808834136
Central limit and other weak theorems (60F05) Probabilistic methods, stochastic differential equations (65C99)
Related Items
Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits, Scaling Limits for the Transient Phase of Local Metropolis–Hastings Algorithms, Optimal scaling of the random walk Metropolis on elliptically symmetric unimodal targets, Optimal scaling for various Metropolis-Hastings algorithms., Optimal Scaling of the Random Walk Metropolis: General Criteria for the 0.234 Acceptance Rule, Bayesian computation: a summary of the current state, and samples backwards and forwards, Random partition models and complementary clustering of Anglo-Saxon place-names