Pages that link to "Item:Q5066742"
From MaRDI portal
The following pages link to Automated Redistricting Simulation Using Markov Chain Monte Carlo (Q5066742):
Displayed 11 items.
- Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans (Q58510) (← links)
- Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions (Q58516) (← links)
- A parallel evolutionary multiple-try Metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions (Q2029093) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Constraint-based electoral districting using a new compactness measure: an application to Portugal (Q2676289) (← links)
- Metropolized Multiscale Forest Recombination for Redistricting (Q5022764) (← links)
- Sampling Algorithms for Discrete Markov Random Fields and Related Graphical Models (Q5881990) (← links)
- Reconfiguration of connected graph partitions via recombination (Q5925556) (← links)
- Redistricting optimization with recombination: a local search case study (Q6068697) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
- Irreducibility of recombination Markov chains in the triangular lattice (Q6202939) (← links)