Is Partial-Dimension Convergence a Problem for Inferences from MCMC Algorithms? release_75u6fnbhxjblbagvszri7mwypa

by Jeff Gill

Published in Political Analysis by Cambridge University Press (CUP).

2008   Volume 16, Issue 02, p153-178

Abstract

Increasingly, political science researchers are turning to Markov chain Monte Carlo methods to solve inferential problems with complex models and problematic data. This is an enormously powerful set of tools based on replacing difficult or impossible analytical work with simulated empirical draws from the distributions of interest. Although practitioners are generally aware of the importance of convergence of the Markov chain, many are not fully aware of the difficulties in fully assessing convergence across multiple dimensions. In most applied circumstances, every parameter dimension must be converged for the others to converge. The usual culprit is slow mixing of the Markov chain and therefore slow convergence towards the target distribution. This work demonstrates the partial convergence problem for the two dominant algorithms and illustrates these issues with empirical examples.
In application/xml+jats format

Archived Files and Locations

application/pdf  373.5 kB
file_ftvtqssql5ezleibhv3i3moxpq
web.archive.org (webarchive)
artsci.wustl.edu (web)
web.archive.org (webarchive)
web.archive.org (webarchive)
artsci.wustl.edu (web)
+ 2 more URLs
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Year   2008
Language   en ?
Container Metadata
Not in DOAJ
In Keepers Registry
ISSN-L:  1047-1987
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: b6b65bb9-79c5-4951-ba6e-11f9713a6fd1
API URL: JSON