Ordering and improving the performance of Monte Carlo Markov chains.
type: Item
instance of: scholarly article
title: Ordering and improving the performance of Monte Carlo Markov chains.
zbMATH Open document ID: 1127.60312
author: Antonietta Mira
published in: Statistical Science
publication date: 2004-05-27T00:00:00Z
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 60J05
Mathematics Subject Classification ID: 65C05
Mathematics Subject Classification ID: 65C40
zbMATH DE Number: 2068936
zbMATH Keywords: Asymptotic variance
zbMATH Keywords: convergence ordering
zbMATH Keywords: covariance ordering
zbMATH Keywords: efficiency ordering
zbMATH Keywords: Metropolis-Hastings algorithm
zbMATH Keywords: Peskun ordering
zbMATH Keywords: reversible jumps
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1214/ss/1015346319
OpenAlex ID: W2005548917
cites work: Monotone and Convex Operator Functions
cites work: Q4272783
cites work: A geometric interpretation of the Metropolis-Hastings algorithm.
cites work: Rao-Blackwellisation of sampling schemes
cites work: Improving Convergence of the Hastings–Metropolis Algorithm with an Adaptive Proposal
cites work: Analysis of a nonreversible Markov chain sampler.
cites work: Q4272795
cites work: Optimal spectral structure of reversible stochastic matrices, Monte Carlo methods and the simulation of Markov random fields
cites work: Sampling-Based Approaches to Calculating Marginal Densities
cites work: Adaptive Markov Chain Monte Carlo through Regeneration
cites work: Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
cites work: Delayed rejection in reversible jump Metropolis-Hastings.
cites work: Outperforming the Gibbs sampler empirical estimator for nearest-neighbor random fields
cites work: Efficiency of empirical estimators for Markov chains
cites work: Reversible Markov chains and optimality of symmetrized empirical estimators
cites work: Adaptive proposal distribution for random walk Metropolis algorithm
cites work: An adaptive Metropolis algorithm
cites work: Q4322327
cites work: Markov chain Monte Carlo and Rao-Blackwellization
cites work: Q4527097
cites work: Efficiency and Convergence Properties of Slice Samplers
cites work: Q4217795
cites work: Optimum Monte-Carlo sampling using Markov chains
cites work: Q4865936
cites work: Q4363938
cites work: Markov chains for exploring posterior distributions. (With discussion)
cites work: A note on Metropolis-Hastings kernels for general state spaces
DOI: 10.1214/SS/1015346319
description: scientific article; zbMATH DE number 2068936