scientific article; zbMATH DE number 6408811
From MaRDI portal
Publication:5176528
zbMath1329.60263arXiv1307.1799MaRDI QIDQ5176528
Krzysztof Łatuszyński, Jeffrey S. Rosenthal
Publication date: 26 February 2015
Full work available at URL: https://arxiv.org/abs/1307.1799
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Discrete-time Markov processes on general state spaces (60J05) Numerical analysis or methods applied to Markov chains (65C40)
Related Items (4)
Adaptive MCMC for multiple changepoint analysis with applications to large datasets ⋮ Rate-optimal refinement strategies for local approximation MCMC ⋮ Stability of adversarial Markov chains, with an application to adaptive MCMC algorithms ⋮ Bayesian computation: a summary of the current state, and samples backwards and forwards
Cites Work
- Unnamed Item
- Convergence of adaptive and interacting Markov chain Monte Carlo algorithms
- Markov chains and stochastic stability
- On adaptive Markov chain Monte Carlo algorithms
- General state space Markov chains and MCMC algorithms
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Geometric ergodicity and hybrid Markov chains
- Optimal scaling for various Metropolis-Hastings algorithms.
- Adaptive Gibbs samplers and related MCMC methods
- Efficient MCMC for climate model parameter estimation: parallel adaptive chains and early rejection
- A note on formal constructions of sequential conditional couplings
- Adaptive Markov Chain Monte Carlo through Regeneration
- Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
- An adaptive Metropolis algorithm
This page was built for publication:
