Metropolized Multiscale Forest Recombination for Redistricting

DOI10.1137/21M1406854zbMath1480.60201OpenAlexW4206619443MaRDI QIDQ5022764

Daniel Carter, Zach Hunter, Gregory Herschlag, Eric A. Autry, Jonathan C. Mattingly

Publication date: 19 January 2022

Published in: Multiscale Modeling & Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/21m1406854

zbMATH Keywords

Metropolis-Hastingsspanning treesmultiscale computationredistrictinghierarchical samplingmultilevel graphs

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Applications of statistics to social sciences (62P25) Trees (05C05) Monte Carlo methods (65C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

Irreducibility of recombination Markov chains in the triangular lattice, Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions

Cites Work

• Unnamed Item
• The average number of spanning trees in sparse graphs with given degrees
• An Optimization Based Heuristic for Political Districting
• Assessing significance in a Markov chain without mixing
• Automated Redistricting Simulation Using Markov Chain Monte Carlo