Dynamic Ideal Point Estimation via Markov Chain Monte Carlo for the U.S. Supreme Court, 1953–1999
نویسندگان
چکیده
منابع مشابه
Dynamic Weighting In Markov Chain Monte Carlo
This article provides a rst theoretical analysis on a new Monte Carlo approach, the dynamic weighting, proposed recently by Wong and Liang. In dynamic weighting, one augments the original state space of interest by a weighting factor, which allows the resulting Markov chain to move more freely and to escape from local modes. It uses a new invari-ance principle to guide the construction of trans...
متن کاملBayesian Computation Via Markov Chain Monte Carlo
A search for Markov chain Monte Carlo (or MCMC) articles on Google Scholar yields over 100,000 hits, and a general web search on Google yields 1.7 million hits. These results stem largely from the ubiquitous use of these algorithms in modern computational statistics, as we shall now describe. MCMC algorithms are used to solve problems in many scientific fields, including physics (where many MCM...
متن کاملInferring Multi-Dimensional Ideal Points for US Supreme Court Justices
In Supreme Court parlance and the political science literature, an ideal point positions a justice in a continuous space and can be interpreted as a quantification of the justice’s policy preferences. We present an automated approach to infer such ideal points for justices of the US Supreme Court. This approach combines topic modeling over case opinions with the voting (and endorsing) behavior ...
متن کاملBayesian parameter estimation in dynamic population model via particle Markov chain Monte Carlo
In nature, population dynamics are subject to multiple sources of stochasticity. State-space models (SSMs) provide an ideal framework for incorporating both environmental noises and measurement errors into dynamic population models. In this paper, we present a recently developed method, Particle Markov Chain Monte Carlo (Particle MCMC), for parameter estimation in nonlinear SSMs. We use one eff...
متن کاملMarkov Chain Monte Carlo
Markov chain Monte Carlo is an umbrella term for algorithms that use Markov chains to sample from a given probability distribution. This paper is a brief examination of Markov chain Monte Carlo and its usage. We begin by discussing Markov chains and the ergodicity, convergence, and reversibility thereof before proceeding to a short overview of Markov chain Monte Carlo and the use of mixing time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Political Analysis
سال: 2002
ISSN: 1047-1987,1476-4989
DOI: 10.1093/pan/10.2.134