Convergence of slice sampler Markov chains

We analyse theoretical properties of the slice sampler. We find that the al gorithm has extremely robust geometric ergodicity properties. For the case of just one auxiliary variable, we demonstrate that the algorithm is stocha stically monotone, and we deduce analytic bounds on the total variation dis tance from stationarity of the method by using Foster-Lyapunov drift condit ion methodology.