| Author Info |
| Abstract |
In this paper we examine the implications of the statistical large sample theory for the computational complexity of Bayesian and quasi-Bayesian estimation carried out using Metropolis random walks. Our analysis is motivated by the Laplace-Bernstein-Von Mises central limit theorem, which states that in large samples the posterior or quasi-posterior approaches a normal density. Using this observation, we establish polynomial bounds on the computational complexity of general Metropolis random walks methods in large samples. Our analysis covers cases, where the underlying log-likelihood or extremum criterion function is possibly nonconcave, discontinuous, and of increasing dimension. However, the central limit theorem restricts the deviations from continuity and log-concavity of the log-likelihood or extremum criterion function in a very specific manner.
| Download Info |
If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.
| Publisher Info |
Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF
Contact details of provider:
Postal: The Institute for Fiscal Studies 7 Ridgmount Street LONDON WC1E 7AE
Phone: (+44) 020 7291 4800
Fax: (+44) 020 7323 4780
Email:
Web page: http://cemmap.ifs.org.uk
Order Information:
Postal: The Institute for Fiscal Studies 7 Ridgmount Street LONDON WC1E 7AE
Email:
For technical questions regarding this item, or to correct its listing, contact: (Emma Hyman).
| Related research |
This paper has been announced in the following NEP Reports:
| Statistics |
Did you know? IDEAS is not the only service displaying RePEc data. Choose on RePEc which service fits your needs best.
This page was last updated on 2009-11-27.