SMALL AND PSEUDO-SMALL SETS FOR MARKOV CHAINS
From MaRDI portal
Publication:2746230
DOI10.1081/STM-100002060zbMath0981.60068MaRDI QIDQ2746230
Gareth O. Roberts, Jeffrey S. Rosenthal
Publication date: 10 October 2001
Published in: Stochastic Models (Search for Journal in Brave)
Related Items (5)
Nonasymptotic bounds on the estimation error of MCMC algorithms ⋮ Perfect simulation for a class of positive recurrent Markov chains ⋮ Small sets and Markov transition densities. ⋮ Quantitative bounds on convergence of time-inhomogeneous Markov chains ⋮ Perfect Forward Simulation via Simulated Tempering
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Faithful couplings of Markov chains: Now equals forever
- Markov chains and stochastic stability
- Shift-coupling
- Stochastic inequalities on partially ordered spaces
- An interruptible algorithm for perfect sampling via Markov chains
- Rates of convergence for data augmentation on finite sample spaces
- Bounds on regeneration times and convergence rates for Markov chains
- Markov chains for exploring posterior distributions. (With discussion)
- Computable exponential convergence rates for stochastically ordered Markov processes
- Shift-coupling and convergence rates of ergodic averages
- General Irreducible Markov Chains and Non-Negative Operators
- Convergence of random walks on the circle generated by an irrational rotation
- Exact Sampling from a Continuous State Space
- Markov-chain monte carlo: Some practical implications of theoretical results
- Rates of convergence of stochastically monotone and continuous time Markov models
- Convergence Rates for Markov Chains
- Geometric Convergence Rates for Stochastically Ordered Markov Chains
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Contributions to Doeblin's theory of Markov processes
This page was built for publication: SMALL AND PSEUDO-SMALL SETS FOR MARKOV CHAINS
