Computing the exact distributions of some functions of the ordered multinomial counts

Maximum, minimum, range and sums of order statistics

Journal Article (2019)
Author(s)

M. Bonetti (Bocconi University)

P. Cirillo (TU Delft - Applied Probability)

Anton Ogay (Student TU Delft)

Research Group
Applied Probability
Copyright
© 2019 M. Bonetti, P. Cirillo, Anton Ogay
DOI related publication
https://doi.org/10.1098/rsos.190198
More Info
expand_more
Publication Year
2019
Language
English
Copyright
© 2019 M. Bonetti, P. Cirillo, Anton Ogay
Research Group
Applied Probability
Issue number
10
Volume number
6
Pages (from-to)
1-32
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Starting from seminal neglected work by Rappeport (Rappeport 1968 Algorithms and computational procedures for the application of order statistics to queuing problems. PhD thesis, New York University), we revisit and expand on the exact algorithms to compute the distribution of the maximum, the minimum, the range and the sum of the J largest order statistics of a multinomial random vector under the hypothesis of equiprobability. Our exact results can be useful in all those situations in which the multinomial distribution plays an important role, from goodness-of-fit tests to the study of Poisson processes, with applications spanning from biostatistics to finance. We describe the algorithms, motivate their use in statistical testing and illustrate two applications. We also provide the codes and ready-to-use tables of critical values.