redist (Q58523)

From MaRDI portal
Simulation Methods for Legislative Redistricting
Language Label Description Also known as
English
redist
Simulation Methods for Legislative Redistricting

    Statements

    4.1.1
    3 April 2023
    0 references
    1.0
    18 May 2015
    0 references
    1.1
    19 May 2015
    0 references
    1.2
    21 August 2015
    0 references
    1.3-1
    15 March 2017
    0 references
    1.3-2
    18 October 2018
    0 references
    1.3-3
    15 December 2018
    0 references
    1.3
    21 December 2016
    0 references
    2.0.1
    20 September 2020
    0 references
    2.0.2
    14 October 2020
    0 references
    3.0.1
    7 April 2021
    0 references
    3.0.7
    15 May 2021
    0 references
    3.1.1
    5 September 2021
    0 references
    3.1.3
    14 September 2021
    0 references
    3.1.4
    19 September 2021
    0 references
    3.1.5
    6 October 2021
    0 references
    4.0.1
    16 June 2022
    0 references
    4.1.0
    19 March 2023
    0 references
    4.2.0
    13 January 2024
    0 references
    0 references
    0 references
    0 references
    13 January 2024
    0 references
    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 the SMC algorithm of McCartan and Imai (2023) <doi:10.1214/23-AOAS1763>, the enumeration algorithm of Fifield, Imai, Kawahara, and Kenny (2020) <doi:10.1080/2330443X.2020.1791773>, the Flip MCMC algorithm of Fifield, Higgins, Imai and Tarr (2020) <doi:10.1080/10618600.2020.1739532>, the Merge-split/Recombination algorithms of Carter et al. (2019) <arXiv:1911.01503> and DeFord et al. (2021) <doi:10.1162/99608f92.eb30390f>, and the Short-burst optimization algorithm of Cannon et al. (2020) <arXiv:2011.02288>.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references