Partitioning Israeli Municipalities into Politically Homogeneous Cantons: A Constrained Spatial Clustering Approach

2026-03-12

AI Summary

This study addresses the pronounced political polarization in Israel in recent years by proposing a novel administrative redistricting framework that jointly optimizes political homogeneity and geographic contiguity. Leveraging election results and geographic boundaries from 229 municipalities, the approach integrates multiple clustering algorithms—including simulated annealing, connectivity-constrained agglomerative clustering, Louvain, and K-Means—with diverse feature representations such as BlocShares, RawParty, PCA, and NMF under various distance metrics. The work presents the first large-scale empirical integration of political coherence and spatial continuity constraints, accompanied by a multidimensional evaluation framework. The optimal partition achieves a silhouette coefficient of 0.905, revealing five distinct politico-demographic regions at K=5, with perfect partition stability (Adjusted Rand Index = 1.0) across five consecutive elections. An interactive web application implementing the methodology has been publicly released.

Technology Category

• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Search and Optimization: Distributed Search
• Machine Learning: Clustering

Application Category

• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs
• Web Mining and Content Analysis: Robustness and generalizability of Web mining methods
• Social Networks and Social Media: Media and governance, opinion dynamics, filter bubbles, polarization

Abstract

Israeli society has experienced significant political polarization in recent years, reflected in five Knesset elections held within a four-year period (2019-2022). Public discourse increasingly references hypothetical divisions of the country into politically homogeneous "cantons." This paper develops a data-driven algorithmic approach to explore such divisions using publicly available municipality-level election results and geographic boundary data from the Israel Central Bureau of Statistics. We partition 229 Israeli municipalities into geographically contiguous cantons that maximize internal political similarity. Our methodology employs four clustering algorithms -- Simulated Annealing, Agglomerative Clustering with contiguity constraints, Louvain Community Detection, and K-Means (baseline) -- evaluated across four feature representations (BlocShares, RawParty, PCA, NMF), three distance metrics (Euclidean, Cosine, Jensen-Shannon), and six values of K (3-20), yielding 264 experimental configurations. Key results show that BlocShares with Euclidean distance and Agglomerative clustering produces the highest clustering quality (silhouette score 0.905), while NMF with Louvain community detection achieves the best balance between political homogeneity, silhouette quality (0.121), and interpretable canton assignments. Temporal stability analysis across all five elections reveals that deterministic algorithms produce near-perfectly stable partitions (ARI up to 1.0), while Israel's political geography remains structurally consistent despite electoral volatility. The resulting K=5 partition identifies five politically coherent regions -- a center-leaning metropolitan core, a right-wing southern arc, a right-leaning northern mixed region, and two Arab-majority cantons -- closely reflecting known political-demographic divisions. An interactive web application accompanies this work.

Problem

• political polarization
• spatial clustering
• homogeneous cantons
• municipality partitioning
• electoral geography

Innovation

• constrained spatial clustering
• political homogeneity
• NMF-Louvain integration
• temporal stability analysis
• geographically contiguous partitions