Revisiting the Majority Problem: Average-Case Analysis with Arbitrarily Many Colours
Data Structures and Algorithms
2018-01-08 v2
Abstract
The majority problem is a special case of the heavy hitters problem. Given a collection of coloured balls, the task is to identify the majority colour or state that no such colour exists. Whilst the special case of two-colours has been well studied, the average-case performance for arbitrarily many colours has not. In this paper, we present heuristic analysis of the average-case performance of three deterministic algorithms that appear in the literature. We empirically validate our analysis with large scale simulations.
Cite
@article{arxiv.1606.05123,
title = {Revisiting the Majority Problem: Average-Case Analysis with Arbitrarily Many Colours},
author = {Anthony Kleerekoper},
journal= {arXiv preprint arXiv:1606.05123},
year = {2018}
}
Comments
13 pages (16 with appendices), 5 figures