Learn R Programming

⚠️There's a newer version (4.3.0) of this package.Take me there.

redist (version 2.0.1)

Simulation Methods for Legislative Redistricting

Description

Enables researchers to sample redistricting plans from a pre-specified target distribution using Sequential Monte Carlo and Markov Chain Monte Carlo algorithms. The package allows for the implementation of various constraints in the redistricting process such as geographic compactness and population parity requirements. Tools for analysis such as computation of various summary statistics and plotting functionality are also included. The package implements methods described in Fifield, Higgins, Imai and Tarr (2020) , Fifield, Imai, Kawahara, and Kenny (2020) , and McCartan and Imai (2020) .

Copy Link

Version

Install

install.packages('redist')

Monthly Downloads

505

Version

2.0.1

License

GPL (>= 2)

Maintainer

Ben Fifield

Last Published

September 20th, 2020

Functions in redist (2.0.1)

as.matrix.redist

Extract the redistricting matrix from a redist object
redist.enumerate

Exact Redistricting Plan Enumerator
redist.findparams

Run parameter testing for redist.mcmc
redist.init.enumpart

Initialize enumpart
redist.ipw

Inverse probability reweighting for MCMC Redistricting
redist.combine.anneal

redist.combine.anneal
redist.mcmc.anneal

MCMC Redistricting Simulator using Simulated Annealing
redist.combine.mpi

Combine successive runs of redist.mcmc.mpi
redist.compactness

Calculate compactness measures for a set of districts
redist.mcmc.mpi

MCMC Redistricting Simulator using MPI
redist.samplepart

Sample partitions using spanning trees
redist.segcalc

Segregation index calculation for MCMC redistricting.
redist.crsg

Redistricting via Compact Random Seed and Grow Algorithm
redist.diagplot

Diagnostic plotting functionality for MCMC redistricting.
redist.calc.frontier.size

Calculate Frontier Size
redist.metrics

Calculate gerrymandering metrics for a set of districts
redist.parity

Calculates Population Parity
redist.distances

Compute Distance between Partitions
redist.read.enumpart

Read Results from enumpart
redist.prep.enumpart

Prepares a run of the enumpart algorithm by ordering edges
redist.run.enumpart

Runs the enumpart algorithm
redist.rsg

Redistricting via Random Seed and Grow Algorithm
redist.combine

Combine successive runs of redist.mcmc
redist.map

Creates a map with optional graph overlay
redist.mcmc

MCMC Redistricting Simulator
redist.smc

SMC Redistricting Sampler
redist.smc_is_ci

Confidence Intervals for Importance Sampling Estimates
fl25

Florida 25 Precinct File
algdat.p10

All Partitions of 25 Precincts into 3 Congressional Districts (10% Population Constraint)
fl70

Florida 70 Precinct File
fl250

Florida 250 Precinct File
algdat.pfull

All Partitions of 25 Precincts into 3 Congressional Districts (No Population Constraint)
redist-package

Markov Chain Monte Carlo Methods for Redistricting Simulation
algdat.p20

All Partitions of 25 Precincts into 3 Congressional Districts (20% Population Constraint)
is_last

check if last edge
redist.adjacency

Adjacency List functionality for redist