An Adaptive Markov Chain Monte Carlo Method for GARCH Model

Tetsuya Takaishi

Papers from arXiv.org

Abstract: We propose a method to construct a proposal density for the Metropolis-Hastings algorithm in Markov Chain Monte Carlo (MCMC) simulations of the GARCH model. The proposal density is constructed adaptively by using the data sampled by the MCMC metho d itself. It turns out that autocorrelations between the data generated with our adaptive proposal density are greatly reduced. Thus it is concluded that the adaptive construction method is very efficient and works well for the MCMC simulations of the GARCH model.

Date: 2009-01
New Economics Papers: this item is included in nep-ecm, nep-ets and nep-ore
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Published in Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Complex Sciences, vol. 5 (2009) 1424-1434

Downloads: (external link)
http://arxiv.org/pdf/0901.0992 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:0901.0992

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().