Papers › Geometric averages of partitioned datasets
Geometric averages of partitioned datasets
Tom Needham, Thomas Weighill
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We introduce a method for jointly registering ensembles of partitioned datasets in a way which is both geometrically coherent and partition-aware. Once such a registration has been defined, one can group partition blocks across datasets in order to extract summary statistics, generalizing the commonly used order statistics for scalar-valued data. By modeling a partitioned dataset as an unordered k-tuple of points in a Wasserstein space, we are able to draw from techniques in optimal transport. More generally, our method is developed using the formalism of local Fr\'{e}chet means in symmetric products of metric spaces. We establish basic theory in this general setting, including Alexandrov curvature bounds and a verifiable characterization of local means. Our method is demonstrated on ensembles of political redistricting plans to extract and visualize basic properties of the space of plans for a particular state, using North Carolina as our main example.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections