A discrete districting plan

DOI10.3934/nhm.2019031zbMath1433.91112arXiv1812.05047OpenAlexW3104542800MaRDI QIDQ2303654

Giorgio Saracco, Alberto Saracco

Publication date: 4 March 2020

Published in: Networks and Heterogeneous Media (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.05047

zbMATH Keywords

networksgraphsdiscrete geometryisoperimetric problemgerrymandering

Mathematics Subject Classification ID

Voting theory (91B12) Optimization of shapes other than minimal surfaces (49Q10) Discrete geometry (52C99) Mathematical geography and demography (91D20)

Related Items (3)

Is Math Useful? ⋮ Minimizers of the prescribed curvature functional in a Jordan domain with no necks ⋮ The isoperimetric problem in 2d domains without necks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limits of dense graph sequences
• Bicolored graph partitioning, or: gerrymandering at its worst
• On the isoperimetric problem with double density
• The prescribed mean curvature equation in weakly regular domains
• Weighted Cheeger sets are domains of isoperimetry
• Two examples of minimal Cheeger sets in the plane
• Political districting: from classical models to recent approaches
• The Wulff crystal in Ising and percolation models. École d'Été de Probabilités de Saint-Flour XXXIV -- 2004
• Su una teoria generale della misura \((r-1)\)-dimensionale in uno spazio ad \(r\) dimensioni
• Evaluation and Optimization of Electoral Systems
• A Polynomial Algorithm for the k-cut Problem for Fixed k
• Γ-limit of the cut functional on dense graph sequences
• Total Variation Isoperimetric Profiles

This page was built for publication: A discrete districting plan