Honest exploration of intractable probability distributions via Markov chain Monte Carlo.

DOI10.1214/ss/1015346317zbMath1127.60309OpenAlexW2001074797MaRDI QIDQ1431211

James P. Hobert, Galin L. Jones

Publication date: 27 May 2004

Published in: Statistical Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/ss/1015346317

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Discrete-time Markov processes on general state spaces (60J05) Numerical analysis or methods applied to Markov chains (65C40)

Related Items

Geometric ergodicity of Pólya-Gamma Gibbs sampler for Bayesian logistic regression with a flat prior, Weighted batch means estimators in Markov chain Monte Carlo, A mixture representation of \(\pi\) with applications in Markov chain Monte Carlo and perfect sampling., Sufficient burn-in for Gibbs samplers for a hierarchical random effects model., Maximum likelihood estimation of the Markov-switching GARCH model, Parameter estimation via stochastic variants of the ECM algorithm with applications to plant growth modeling, A modified conditional Metropolis-Hastings sampler, Information-geometric Markov chain Monte Carlo methods using diffusions, Convergence rates of two-component MCMC samplers, Exact convergence analysis of the independent Metropolis-Hastings algorithms, A computational procedure for estimation of the mixing time of the random-scan Metropolis algorithm, A quantitative approach for polymerase chain reactions based on a hidden Markov model, Batch means and spectral variance estimators in Markov chain Monte Carlo, Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits, Convergence rates of attractive-repulsive MCMC algorithms, Bayesian Inference in the Presence of Intractable Normalizing Functions, On the mixing time of Kac's walk and other high-dimensional Gibbs samplers with constraints, Multiplicative random walk Metropolis-Hastings on the real line, Geometric ergodicity of a more efficient conditional Metropolis-Hastings algorithm, The Pólya-gamma Gibbs sampler for Bayesian logistic regression is uniformly ergodic, Applicability of Subsampling Bootstrap Methods in Markov Chain Monte Carlo, Some things we've learned (about Markov chain Monte Carlo), Batch size selection for variance estimators in MCMC, Stochastic alternating projections, Rigorous confidence bounds for MCMC under a geometric drift condition, Rates of convergence for Gibbs sampling in the analysis of almost exchangeable data, Reflections on Bayesian inference and Markov chain Monte Carlo, MCMC diagnostics for higher dimensions using Kullback Leibler divergence, Complexity results for MCMC derived from quantitative bounds, Shrinkage with shrunken shoulders: Gibbs sampling shrinkage model posteriors with guaranteed convergence rates, Geometric ergodicity of a hybrid sampler for Bayesian inference of phylogenetic branch lengths, Two noniterative algorithms for computing posteriors, A theoretical comparison of the data augmentation, marginal augmentation and PX-DA algorithms, Gibbs sampling, exponential families and orthogonal polynomials, Comment: ``Gibbs sampling, exponential families, and orthogonal polynomials, Markov chain Monte Carlo: can we trust the third significant figure?, Optimal scaling of random-walk Metropolis algorithms on general target distributions, Asynchronous and Distributed Data Augmentation for Massive Data Settings, Gibbs sampling, conjugate priors and coupling, A short history of Markov chain Monte Carlo: Subjective recollections from incomplete data, Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances, Nonasymptotic bounds on the estimation error of MCMC algorithms, Exact sampling for intractable probability distributions via a Bernoulli factory, Convergence rates for MCMC algorithms for a robust Bayesian binary regression model, Gibbs sampling for a Bayesian hierarchical general linear model, Convergence rate of Markov chain methods for genomic motif discovery, Convergence analysis of the block Gibbs sampler for Bayesian probit linear mixed models with improper priors, A general framework for the parametrization of hierarchical models, Improving the convergence properties of the data augmentation algorithm with an application to Bayesian mixture modeling, The mathematics of mixing things up, Data augmentation, frequentist estimation, and the Bayesian analysis of multinomial logit models, A Gibbs sampler on the \(n\)-simplex, Geometric ergodicity for Bayesian shrinkage models, Variance bounding Markov chains, Function-specific mixing times and concentration away from equilibrium, Geometric ergodicity of a Metropolis-Hastings algorithm for Bayesian inference of phylogenetic branch lengths, Markov chain Monte Carlo estimation of quantiles, Sampling Conditionally on a Rare Event via Generalized Splitting, Geometric ergodicity of random scan Gibbs samplers for hierarchical one-way random effects models, On the limitations of single-step drift and minorization in Markov chain convergence analysis, Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: continuous dynamics, Consistent estimation of the accuracy of importance sampling using regenerative simulation, Fast mixing of Metropolis-Hastings with unimodal targets, Trace-class Monte Carlo Markov chains for Bayesian multivariate linear regression with non-Gaussian errors, Stability of the Gibbs sampler for Bayesian hierarchical models, Fast Monte Carlo Markov chains for Bayesian shrinkage models with random effects, Connections and Extensions: A Discussion of the Paper by Girolami and Byrne, On Monte Carlo methods for Bayesian multivariate regression models with heavy-tailed errors, Convergence of Conditional Metropolis-Hastings Samplers, Quantitative non-geometric convergence bounds for independence samplers, Trace Class Markov Chains for Bayesian Inference with Generalized Double Pareto Shrinkage Priors, Experiments with the site frequency spectrum, Multivariate initial sequence estimators in Markov chain Monte Carlo, Quantitative bounds on convergence of time-inhomogeneous Markov chains, Bayesian system identification via Markov chain Monte Carlo techniques, Geometric Ergodicity and Scanning Strategies for Two-Component Gibbs Samplers, Hitting time and convergence rate bounds for symmetric Langevin diffusions, Harris recurrence of Metropolis-within-Gibbs and trans-dimensional Markov chains, Quantitative bounds of convergence for geometrically ergodic Markov chain in the Wasserstein distance with application to the Metropolis adjusted Langevin algorithm, Bounds on regeneration times and limit theorems for subgeometric Markov chains, Component-wise Markov chain Monte Carlo: uniform and geometric ergodicity under mixing and composition, Convergence analysis of a collapsed Gibbs sampler for Bayesian vector autoregressions, Trivial intersection of \(\sigma \)-fields and Gibbs sampling, The Markov chain Monte Carlo revolution, Uncertainty Quantification for Modern High-Dimensional Regression via Scalable Bayesian Methods, Micro-local analysis for the Metropolis algorithm, Rates of convergence of some multivariate Markov chains with polynomial eigenfunctions, Convergence complexity analysis of Albert and Chib's algorithm for Bayesian probit regression, Bayesian estimation in Kibble's bivariate gamma distribution, Block Gibbs samplers for logistic mixed models: convergence properties and a comparison with full Gibbs samplers, A hybrid scan Gibbs sampler for Bayesian models with latent variables, Revisiting the Gelman-Rubin diagnostic, On the geometric ergodicity of Hamiltonian Monte Carlo, Consistent estimation of the spectrum of trace class data augmentation algorithms, Convergence rate bounds for iterative random functions using one-shot coupling, Mixing time estimation in reversible Markov chains from a single sample path, High-Dimensional Gaussian Sampling: A Review and a Unifying Approach Based on a Stochastic Proximal Point Algorithm, Mixing times for the commuting chain on CA groups, Wasserstein-based methods for convergence complexity analysis of MCMC with applications

Uses Software

• WinBUGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markov chains and stochastic stability
• Geometric bounds for eigenvalues of Markov chains
• Regenerative structure of Markov chains simulated via common random numbers
• Geometric ergodicity of Gibbs and block Gibbs samplers for a hierarchical random effects model
• A note on Metropolis-Hastings kernels for general state spaces
• On convergence rates of Gibbs samplers for uniform distributions
• On the rate of convergence of the Metropolis algorithm and Gibbs sampler by geometric bounds
• Computable bounds for geometric convergence rates of Markov chains
• A geometric interpretation of the Metropolis-Hastings algorithm.
• Bounds on regeneration times and convergence rates for Markov chains
• Convergence control methods for Markov chain Monte Carlo algorithms
• Bayesian computation and stochastic systems. With comments and reply.
• Geometric ergodicity of Metropolis algorithms
• Algebraic algorithms for sampling from conditional distributions
• Polynomial convergence rates of Markov chains
• Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\).
• Corrigendum to ``Bounds on regeneration times and convergence rates for Markov chains
• Markov chains for exploring posterior distributions. (With discussion)
• Rates of convergence of the Hastings and Metropolis algorithms
• General Irreducible Markov Chains and Non-Negative Operators
• Sampling-Based Approaches to Calculating Marginal Densities
• Simulation Output Analysis Using Standardized Time Series
• The Calculation of Posterior Distributions by Data Augmentation
• Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
• Batch Size Effects in the Analysis of Simulation Output
• Simulating Stable Stochastic Systems: III. Regenerative Processes and Discrete-Event Simulations
• A splitting technique for Harris recurrent Markov chains
• A New Approach to the Limit Theory of Recurrent Markov Chains
• Convergence of Slice Sampler Markov Chains
• Covariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemes
• Maximum Likelihood Algorithms for Generalized Linear Mixed Models
• On the applicability of regenerative simulation in Markov chain Monte Carlo
• Empirical supremum rejection sampling
• Adaptive Markov Chain Monte Carlo through Regeneration
• Discretization of Continuous Markov Chains and Markov Chain Monte Carlo Convergence Assessment
• Regeneration in Markov Chain Samplers
• Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
• Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference
• Geometric Convergence Rates for Stochastically Ordered Markov Chains