Nested Designs with AR Errors via MCMC

Mahdi Alkhamisi
Additional contact information
Mahdi Alkhamisi: Centre for Labour Market Policy Research (CAFO), Postal: Centre for Labour Market Policy Research (CAFO), Dept of Economics and Statistics, School of Management and Economics, Växjö University , SE 351 95 Växjö, Sweden

No 2007:6, CAFO Working Papers from Linnaeus University, Centre for Labour Market Policy Research (CAFO), School of Business and Economics

Abstract: In this paper Markov Chain Monte Carlo algorithms(MCMC) are developed to facilitate the Bayesian analysis on nested designs when the error structure can be expressed as an autoregressive process of order one. Simulated and real data are also presented to confirm the efficiency and high accuracy of our work.

Keywords: Bayesian statistics; Metropolis-Hastings algorithm; Markov chain Monte Carlo methods; repeated measurements; autoregressive process; Gibbs sampling (search for similar items in EconPapers)
JEL-codes: C11 (search for similar items in EconPapers)
Pages: 13 pages
Date: 2007-10-01
References: Add references at CitEc
Citations:

Downloads: (external link)
http://studieportal-elnu.lnu.se/mod/forum/discuss.php?d=379 (application/pdf)
Our link check indicates that this URL is bad, the error code is: 500 Can't connect to studieportal-elnu.lnu.se:80 (No such host is known. )

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:hhs:vxcafo:2007_006

Access Statistics for this paper

More papers in CAFO Working Papers from Linnaeus University, Centre for Labour Market Policy Research (CAFO), School of Business and Economics Centre for Labour Market Policy Research (CAFO), School of Business and Economics, Linnaeus University, SE 351 95 Växjö, Sweden. Contact information at EDIRC.
Bibliographic data for series maintained by Andreas Mångs ( this e-mail address is bad, please contact ).