ideal.## S3 method for class 'ideal':
plot(x, conf.int=0.95, burnin=NULL, ...)plot1d(x, d=1, conf.int=0.95, burnin=NULL,
showAllNames = FALSE, ...)
plot2d(x, d1=1, d2=2, burnin=NULL,
overlayCuttingPlanes=FALSE, ...)
idealconf.int is ignored.NULL, in which case the value of
burnin in the ideal object is used.logical, if TRUE, the
vertical axis will the names of all legislators. Default is
FALSE to reduce clutter on typical-sized graph.ideal objects. This
dimension will appear on the horizontal (x) axis.ideal objects. This dimension
will appear on the vertical (y) axis.TRUE, overlay the
estimated bill-specific cutting planesideal object comes from fitting a d=1
dimensional model, then plot.ideal plots the mean of the
posterior density over each legislator's ideal point, accompanied by a
conf.int confidence interval. In this case, plot.ideal
is simply a wrapper function to plot1d. If the ideal object has d=2 dimensions, then
plot2d is called, which plots the (estimated) mean of
the posterior density of each legislator's ideal point (i.e., the
ideal point/latent trait is a point in 2-dimensional Euclidean space,
and the posterior density for each ideal point is a bivariate
density). Single dimension summaries of the estimated ideal points
(latent traits) can be obtained for multidimensional
ideal objects by passing the ideal object
directly to plot1d with d set appropriately.
If the ideal object has d>2 dimensions, a
scatterplot matrix is produced via pairs, with the
posterior means of the ideal points (latent traits) plotted against
one another, dimension by dimension.
For unidimensional and two-dimensional models, if party information is
available in the rollcall object contained in the ideal
object, legislators from different parties are plotted in different
colors. If the ideal object has more than 2 dimensions,
plot.ideal() produces a matrix of plots of the mean ideal
points of each dimension against the posterior mean ideal points of
the other dimensions.
ideal.
tracex for trace plots, a graphicakl aid useful in
diagnosing convergence of the MCMC algorithms.data(s109)
id1 <- ideal(s109,
d=1,
meanzero=TRUE,
store.item=TRUE,
maxiter=500, ## short run for examples
burnin=100,
thin=10)
plot(id1)Run the code above in your browser using DataLab