A note on geometric ergodicity and floating-point roundoff error
We consider the extent to which Markov chain convergence properties are affected by the presence of computer floating-point roundoff error. Both geometric ergodicity and polynomial ergodicity are considered. This paper extends previous work of Roberts et al. (J. Appl. Probab. 35 (1998) 1) to the case of proportional errors.
Year of publication: |
2001
|
---|---|
Authors: | Breyer, Laird ; Roberts, Gareth O. ; Rosenthal, Jeffrey S. |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 53.2001, 2, p. 123-127
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Scaling limits for the transient phase of local Metropolis-Hastings algorithms
Christensen, Ole F., (2005)
-
Convergence of Slice Sampler Markov Chains
Roberts, Gareth O., (1999)
-
One-shot coupling for certain stochastic recursive sequences
Roberts, Gareth O., (2002)
- More ...