A Simple Algorithm for Exact Multinomial Tests
Not on the map. Why?
Abstract (arXiv)
This work proposes a new method for computing acceptance regions of exact multinomial tests. From this an algorithm is derived, which finds exact p-values for tests of simple multinomial hypotheses. Using concepts from discrete convex analysis, the method is proven to be exact for various popular test statistics, including Pearson's chi-square and the log-likelihood ratio. The proposed algorithm improves greatly on the naive approach using full enumeration of the sample space. However, its use is limited to multinomial distributions with a small number of categories, as the runtime grows exponentially in the number of possible outcomes. The method is applied in a simulation study and uses of multinomial tests in forecast evaluation are outlined. Additionally, properties of a test statistic using probability ordering, referred to as the "exact multinomial test" by some authors, are investigated and discussed. The algorithm is implemented in the accompanying R package ExactMultinom.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 28 Aug 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 0; 2025: 0; 2026: 1.
3 papers.
- 2026Exact Minimum-Volume Confidence Set Intersection for Multinomial Outcomes26 Jan 2026
- 2022Geometry of the Minimum Volume Confidence Sets16 Feb 2022
- 2021Selecting a number of voters for a voting ensemble23 Apr 2021