Understanding Distance Measures Among Elections

05/01/2022
by   Niclas Boehmer, et al.
0

Motivated by putting empirical work based on (synthetic) election data on a more solid mathematical basis, we analyze six distances among elections, including, e.g., the challenging-to-compute but very precise swap distance and the distance used to form the so-called map of elections. Among the six, the latter seems to strike the best balance between its computational complexity and expressiveness.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2019

Generalized Sliced Wasserstein Distances

The Wasserstein distance and its variations, e.g., the sliced-Wasserstei...
research
12/21/2018

Distance Measures for Embedded Graphs

We introduce new distance measures for comparing embedded graphs based o...
research
12/12/2017

Computational Complexity of the Interleaving Distance

The interleaving distance is arguably the most prominent distance measur...
research
02/25/2022

The k-outlier Fréchet distance

The Fréchet distance is a popular metric for curves; however, its bottle...
research
09/23/2020

A Linear Transportation L^p Distance for Pattern Recognition

The transportation L^p distance, denoted TL^p, has been proposed as a ge...
research
12/21/2018

Nonparametric Feature Extraction from Dendrograms

We study nonparametric feature extraction from hierarchies. The commonly...
research
12/24/2010

Computationally Efficient Modulation Level Classification Based on Probability Distribution Distance Functions

We present a novel modulation level classification (MLC) method based on...

Please sign up or login with your details

Forgot password? Click here to reset