Efficiency of finite state space Monte Carlo Markov chains
The class of finite state space Markov chains, stationary with respect to a common pre-specified distribution, is considered. An easy-to-check partial ordering is defined on this class. The ordering provides a sufficient condition for the dominating Markov chain to be more efficient. Efficiency is measured by the asymptotic variance of the estimator of the integral of a specific function with respect to the stationary distribution of the chains. A class of transformations that, when applied to a transition matrix, preserves its stationary distribution and improves its efficiency is defined and studied.
Year of publication: |
2001
|
---|---|
Authors: | Mira, Antonietta |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 54.2001, 4, p. 405-411
|
Publisher: |
Elsevier |
Keywords: | Efficiency ordering Markov chain Monte Carlo Metropolis-Hastings algorithm Peskun ordering Stationarity preserving and efficiency increasing probability mass transfers |
Saved in:
Saved in favorites
Similar items by person
-
The stability of factor models of interests rates
Audrino, Francesco, (2003)
-
Peluso, Stefano, (2019)
-
Reinforced urn processes for credit risk models
Peluso, Stefano, (2015)
- More ...