The Matrix Formulation of Gerrymanders: The Political Interpretation of Eigenfunctions of Connectivity Matrices

J K Wildgen
Additional contact information
J K Wildgen: Morphy Makofsky Mumphrey Masson, Inc., 336 North Jefferson Davis Parkway, New Orleans, LA 70119, USA

Environment and Planning B, 1990, vol. 17, issue 3, 269-276

Abstract: In the 1990s it is going to be easier to draw voting districts. It is also going to be harder to justify them. They are going to have to be explained in terms of increasingly sophisticated theories of fair districting. How, then, does one demonstrate a link between a particular plan and the multiple criteria for fair districting? It is proposed that a reapportionment plan can be described in terms of the eigenfunctions of a connectivity matrix. By making explicit the valencies linking nodes in a network of polygons, and/or adjusting the values in the main diagonal, the mapable eigenvectors of the connectivity matrix representing the network provide a mathematical rationale for a districting plan. This creates the possibility of simultaneously taking into account joint, and sometimes conflicting, districting criteria such as contiguity, equal population, and the protection of communities of interest.

Date: 1990
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b170269 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:envirb:v:17:y:1990:i:3:p:269-276

DOI: 10.1068/b170269

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().