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

Jeff Gill
<span title="">2008</span> <i title="Cambridge University Press (CUP)"> <a target="_blank" rel="noopener" href="" style="color: black;">Political Analysis</a> </i> &nbsp;
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
more &raquo; ... rgence 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.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1093/pan/mpm019</a> <a target="_blank" rel="external noopener" href="">fatcat:75u6fnbhxjblbagvszri7mwypa</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / </button> </a>