Markov-chain monte carlo: Some practical implications of theoretical results
From MaRDI portal
Publication:4399495
DOI10.2307/3315667zbMath0920.62105OpenAlexW2084397209MaRDI QIDQ4399495
Jeffrey S. Rosenthal, Gareth O. Roberts
Publication date: 6 September 1999
Published in: Canadian Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3315667
Probabilistic models, generic numerical methods in probability and statistics (65C20) Markov processes: estimation; hidden Markov models (62M05) Monte Carlo methods (65C05) Discrete-time Markov processes on general state spaces (60J05)
Related Items
Multiplicative random walk Metropolis-Hastings on the real line, Identification of the 1PL model with guessing parameter: parametric and semi-parametric results, Geometric ergodicity of the Bayesian Lasso, Applicability of Subsampling Bootstrap Methods in Markov Chain Monte Carlo, Qualitative Robustness in Bayesian Inference, Efficient shape-constrained inference for the autocovariance sequence from a reversible Markov chain, Geometric ergodicity of the Gibbs sampler for Bayesian quantile regression, Variance bounding Markov chains, Stochastic variable selection strategies for zero-inflated models, Nonparametric estimation of the stationary density and the transition density of a Markov chain, Principal Applications of Bayesian Methods in Actuarial Science, SMALL AND PSEUDO-SMALL SETS FOR MARKOV CHAINS, Trace-class Monte Carlo Markov chains for Bayesian multivariate linear regression with non-Gaussian errors, Fast Monte Carlo Markov chains for Bayesian shrinkage models with random effects, The HESSIAN method: highly efficient simulation smoothing, in a nutshell, Quantitative non-geometric convergence bounds for independence samplers, On the geometric ergodicity of Metropolis-Hastings algorithms, On the Bayesian nonparametric generalization of IRT-type models, Scaling analysis of delayed rejection MCMC methods, Adaptive independent Metropolis-Hastings, Convergence analysis of the Gibbs sampler for Bayesian general linear mixed models with improper priors, Geometric ergodicity of Gibbs and block Gibbs samplers for a hierarchical random effects model, Convergence complexity analysis of Albert and Chib's algorithm for Bayesian probit regression, Scaling analysis of multiple-try MCMC methods, Application of HITS Algorithm in Web Mining in Literature Evaluation and Empirical Study, A hybrid scan Gibbs sampler for Bayesian models with latent variables, Geometric ergodicity of Gibbs samplers for Bayesian general linear mixed models with proper priors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric bounds for eigenvalues of Markov chains
- Optimal spectral structure of reversible stochastic matrices, Monte Carlo methods and the simulation of Markov random fields
- Geometric ergodicity and R-positivity for general Markov chains
- Geometric convergence of the Metropolis-Hastings simulation algorithm
- Two convergence properties of hybrid samplers
- An improved acceptance procedure for the hybrid Monte Carlo algorithm
- Convergence of adaptive direction sampling
- On the rate of convergence of the Metropolis algorithm and Gibbs sampler by geometric bounds
- Sampling from log-concave distributions
- Computable bounds for geometric convergence rates of Markov chains
- Rates of convergence for everywhere-positive Markov chains
- Exponential convergence of Langevin distributions and their discrete approximations
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Geometric ergodicity and hybrid Markov chains
- A quasi-ergodic theorem for evanescent processes
- Inference from iterative simulation using multiple sequences
- A slowly mixing Markov chain with implications for Gibbs sampling
- Markov chains for exploring posterior distributions. (With discussion)
- Markov chain convergence: From finite to infinite
- Computable exponential convergence rates for stochastically ordered Markov processes
- Rates of convergence of the Hastings and Metropolis algorithms
- Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review
- Approximating the Permanent
- General Irreducible Markov Chains and Non-Negative Operators
- Sampling-Based Approaches to Calculating Marginal Densities
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- The Calculation of Posterior Distributions by Data Augmentation
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Truncation approximations of invariant measures for Markov chains
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Covariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemes
- Convergence Properties of Perturbed Markov Chains
- Adaptive Markov Chain Monte Carlo through Regeneration
- Asymptotic Behavior of the Gibbs Sampler
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- A note on acceptance rate criteria for CLTS for Metropolis–Hastings algorithms
- Monte Carlo sampling methods using Markov chains and their applications
