Honest exploration of intractable probability distributions via Markov chain Monte Carlo.
type: Item
instance of: scholarly article
title: Honest exploration of intractable probability distributions via Markov chain Monte Carlo.
zbMATH Open document ID: 1127.60309
author: Galin L. Jones
author: James P. Hobert
published in: Statistical Science
publication date: 2004-05-27T00:00:00Z
Mathematics Subject Classification ID: 60J05
Mathematics Subject Classification ID: 65C05
Mathematics Subject Classification ID: 65C40
zbMATH DE Number: 2068934
describes a project that uses: WinBUGS
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1214/ss/1015346317
OpenAlex ID: W2001074797
cites work: A New Approach to the Limit Theory of Recurrent Markov Chains
cites work: Bayesian computation and stochastic systems. With comments and reply.
cites work: A geometric interpretation of the Metropolis-Hastings algorithm.
cites work: Q3662646
cites work: Empirical supremum rejection sampling
cites work: Markov chains for exploring posterior distributions. (With discussion)
cites work: Simulating Stable Stochastic Systems: III. Regenerative Processes and Discrete-Event Simulations
cites work: Geometric bounds for eigenvalues of Markov chains
cites work: Algebraic algorithms for sampling from conditional distributions
cites work: Q4272795
cites work: Sampling-Based Approaches to Calculating Marginal Densities
cites work: Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference
cites work: Q4864274
cites work: Adaptive Markov Chain Monte Carlo through Regeneration
cites work: Regenerative structure of Markov chains simulated via common random numbers
cites work: Simulation Output Analysis Using Standardized Time Series
cites work: Discretization of Continuous Markov Chains and Markov Chain Monte Carlo Convergence Assessment
cites work: Geometric ergodicity of Gibbs and block Gibbs samplers for a hierarchical random effects model
cites work: On the applicability of regenerative simulation in Markov chain Monte Carlo
cites work: On the rate of convergence of the Metropolis algorithm and Gibbs sampler by geometric bounds
cites work: Geometric ergodicity of Metropolis algorithms
cites work: Polynomial convergence rates of Markov chains
cites work: Q4863617
cites work: Covariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemes
cites work: Geometric Convergence Rates for Stochastically Ordered Markov Chains
cites work: Maximum Likelihood Algorithms for Generalized Linear Mixed Models
cites work: Rates of convergence of the Hastings and Metropolis algorithms
cites work: Markov chains and stochastic stability
cites work: Computable bounds for geometric convergence rates of Markov chains
cites work: Regeneration in Markov Chain Samplers
cites work: A splitting technique for Harris recurrent Markov chains
cites work: General Irreducible Markov Chains and Non-Negative Operators
cites work: Q4720653
cites work: Convergence control methods for Markov chain Monte Carlo algorithms
cites work: Q4267796
cites work: On convergence rates of Gibbs samplers for uniform distributions
cites work: Convergence of Slice Sampler Markov Chains
cites work: Q4363938
cites work: Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
cites work: Bounds on regeneration times and convergence rates for Markov chains
cites work: Corrigendum to ``Bounds on regeneration times and convergence rates for Markov chains''
cites work: Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
cites work: Q4784108
cites work: Batch Size Effects in the Analysis of Simulation Output
cites work: The Calculation of Posterior Distributions by Data Augmentation
cites work: A note on Metropolis-Hastings kernels for general state spaces
cites work: Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\).
DOI: 10.1214/SS/1015346317
description: scientific article; zbMATH DE number 2068934