STV Audit Graphs: A Visual Tool to Measure Election Stability
Abstract
The Single Transferable Vote (STV) is an algorithmic election rule. Round by round, a profile of ranked-choice ballots is reinterpreted to determine which decision to make next, and candidates are seated or eliminated until a full winner set emerges. This algorithmic nature makes STV theoretically more brittle than other election rules: uncertainty about an early round of the election might percolate irreversibly into the rest. For this reason, a generalized non-trivial Risk-Limiting Audit (RLA) framework has remained elusive for STV. Such a framework must concoct a set of null hypotheses, or assertions, whose rejection would bound the probability that the outcome of the election was incorrectly reported. We present audit graphs as a solution to design the assertions needed for RLAs of arbitrary STV elections, as well as quantitatively describe the uncertainty (or lack thereof) of their outcomes. These audit graphs explore election paths that are ``close'' to the recorded one by considering the alternative decisions the STV algorithm might have made if a small number of ballots were perturbed.
Related
- What Does Chain-of-Thought Entropy Measure? A Channel Audit of Scaffolding, Routing, and Content
- Zero measure Cantor spectrum for aperiodic metric tiling graphs
- Stability of Measure-to-Measure Transformers on Sub-Gaussian Data
- Sharp Wasserstein stability and small-delay thresholds for evolution equations with measure-valued principal-part delays
- Geology-Aware Multiscale Fractal Coupling Graphs for Cross-Well Heterogeneity Characterization of Coal-Measure Well Logs in the Eastern Ordos Basin
BibTeX
@misc{heitzmann2026audit,
title = {{STV Audit Graphs: A Visual Tool to Measure Election Stability}},
author = {Edouard Heitzmann},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.10887},
eprint = {2609.10887},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.10887},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - STV Audit Graphs: A Visual Tool to Measure Election Stability
AU - Edouard Heitzmann
PY - 2026
DA - 2026/09/09
PB - arXiv
DO - 10.48550/arxiv.2609.10887
UR - https://arxiv.org/abs/2609.10887
AB - The Single Transferable Vote (STV) is an algorithmic election rule. Round by round, a profile of ranked-choice ballots is reinterpreted to determine which decision to make next, and candidates are seated or eliminated until a full winner set emerges. This algorithmic nature makes STV theoretically more brittle than other election rules: uncertainty about an early round of the election might percolate irreversibly into the rest. For this reason, a generalized non-trivial Risk-Limiting Audit (RLA) framework has remained elusive for STV. Such a framework must concoct a set of null hypotheses, or assertions, whose rejection would bound the probability that the outcome of the election was incorrectly reported. We present audit graphs as a solution to design the assertions needed for RLAs of arbitrary STV elections, as well as quantitatively describe the uncertainty (or lack thereof) of their outcomes. These audit graphs explore election paths that are ``close'' to the recorded one by considering the alternative decisions the STV algorithm might have made if a small number of ballots were perturbed.
ER -