Efficiency of finite state space Monte Carlo Markov chains
AbstractThe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Statistics & Probability Letters.
Volume (Year): 54 (2001)
Issue (Month): 4 (October)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.