Corpus ID: 115855993

# Ordering, Slicing And Splitting Monte Carlo Markov Chains

```@inproceedings{Mira1998OrderingSA,
title={Ordering, Slicing And Splitting Monte Carlo Markov Chains},
author={Antonietta Mira},
year={1998}
}```
• A. Mira
• Published 1998
• Computer Science
Markov chain Monte Carlo is a method of approximating the integral of a function f with respect to a distribution . A Markov chain that has as its stationary distribution is simulated producing samplesX1; X2; : : : . The integral is approximated by taking the average of f(Xn) over the sample path. The standard way to construct such Markov chains is the Metropolis-Hastings algorithm. The class P of all Markov chains having as their unique stationary distribution is very large, so it is important… Expand
On the use of auxiliary variables in Markov chain Monte Carlo sampling
• Computer Science
• 1997
The slice sampler, a method of constructing a reversible Markov chain with a speciied invariant distribution, has a smaller second-largest eigenvalue than the corresponding independence Metropolis-Hastings algorithm. Expand
On the use of auxiliary variables inMarkov chain
• 2007
We study the slice sampler, a method of constructing a reversible Markov chain with a speciied invariant distribution. Given an independence Metropolis-Hastings algorithm it is always possible toExpand
Slice Sampling 1
Markov chain sampling methods that adapt to characteristics of the distribution being sampled can be constructed using the principle that one can sample from a distribution by sampling uniformly fromExpand
Slice Sampling
• 2000
Markov chain sampling methods that automatically adapt to characteristics of the distribution being sampled can be constructed by exploiting the principle that one can sample from a distribution byExpand
Limit theorems for sequential MCMC methods
• Mathematics
• 2020
Abstract Both sequential Monte Carlo (SMC) methods (a.k.a. ‘particle filters’) and sequential Markov chain Monte Carlo (sequential MCMC) methods constitute classes of algorithms which can be used toExpand
On extended state-space constructions for Monte Carlo methods
This thesis develops computationally efficient methodology in two areas. Firstly, we consider a particularly challenging class of discretely observed continuous-time point-process models. For these,Expand
CONVERGENCE RATE OF MARKOV CHAINS ON
Acknowledgments. This work is part of my doctoral research done under the direction of Jeerey S. Rosenthal. I thank Peter Rosenthal for helpful discussions about the operator theory issues. Abstract.Expand
Towards Automatic Reversible Jump Markov Chain Monte Carlo
The automatic sampler that is introduced in the penultimate chapter of the thesis builds upon the first steps taken by Green (2003) and uses adaptive techniques to perform self-tuning and calibration for many trans-dimensional statistical problems. Expand
Delayed Rejection in Reversible
In a Metropolis-Hastings algorithm, rejection of proposed moves is an intrinsic part of ensuring that the chain converges to the intended target distribution. However, persistent rejection, perhapsExpand
Delayed rejection Hamiltonian Monte Carlo for sampling multiscale distributions
• Mathematics, Computer Science
• 2021
A delayed rejection variant of Hamiltonian Monte Carlo that makes one or more subsequent proposals each using a step size geometrically smaller than the last if an initial HMC trajectory is rejected, providing increased robustness to step size misspecification. Expand