Ergodicity of combocontinuous adaptive MCMC algorithms
From MaRDI portal
Publication:1657801
DOI10.1007/s11009-017-9574-3zbMath1394.60079OpenAlexW2587726936MaRDI QIDQ1657801
Jeffrey S. Rosenthal, Jinyoung Yang
Publication date: 14 August 2018
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-017-9574-3
Computational methods in Markov chains (60J22) Markov processes: estimation; hidden Markov models (62M05) Monte Carlo methods (65C05) Discrete-time Markov processes on general state spaces (60J05)
Related Items
An adaptive multiple-try Metropolis algorithm ⋮ Adaptive Incremental Mixture Markov Chain Monte Carlo ⋮ Adaptive Component-Wise Multiple-Try Metropolis Sampling
Uses Software
Cites Work
- Robust adaptive Metropolis algorithm with coerced acceptance rate
- Convergence of adaptive and interacting Markov chain Monte Carlo algorithms
- On adaptive Markov chain Monte Carlo algorithms
- On the ergodicity properties of some adaptive MCMC algorithms
- Stability of adversarial Markov chains, with an application to adaptive MCMC algorithms
- General state space Markov chains and MCMC algorithms
- Harris recurrence of Metropolis-within-Gibbs and trans-dimensional Markov chains
- Markov chains for exploring posterior distributions. (With discussion)
- On the efficiency of adaptive MCMC algorithms
- Handbook of Markov Chain Monte Carlo
- Robust Empirical Bayes Analyses of Event Rates
- Equation of State Calculations by Fast Computing Machines
- Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
- Monte Carlo sampling methods using Markov chains and their applications
- An adaptive Metropolis algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item