arXiv (All)
open access
Generalized Sequential Monte Carlo Sampling for Redistricting Simulation
Simulation methods have become important tools for quantifying partisan and racial bias in redistricting plans. We generalize the Sequential Monte Carlo (SMC) algorithm of McCartan and Imai (2023), one of the commonly used approaches. First, our generalized SMC (gSMC) algorithm can split off regions
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Connectivity of Districting Metagraphs#986871
- 28 U.S.C. § 1866 — Selection and summoning of jury panels#556870
- Constant-Memory Differentiable Light Tracing#1117632
- Joint Committee on Electoral Matters#324781
- Where Do We Draw the Line?: The Justiciability of Political Gerrymandering Claims in Light of League of United Latin American Citizens v. Perry#181418
Record · ID 986834
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive