On the multiplicity of the maximum in a discrete random sample

Research output: Contribution to journalArticleResearchpeer review

Authors

  • F. Thomas Bruss
  • Rudolf Grübel

External Research Organisations

  • Free University of Brussels (ULB)
View graph of relations

Details

Original languageEnglish
Pages (from-to)1252-1263
Number of pages12
JournalAnnals of Applied Probability
Volume13
Issue number4
Publication statusPublished - Nov 2003

Abstract

Let Mn be the maximum of a sample X1,...,X n from a discrete distribution and let Wn be the number of i's, 1 ≤ i ≤ n, such that Xi=Mn. We discuss the asymptotic behavior of the distribution of Wn as n → ∞. The probability that the maximum is unique is of interest in diverse problems, for example, in connection with an algorithm for selecting a winner, and has been studied by several authors using mainly analytic tools. We present here an approach based on the Sukhatme-Rényi representation of exponential order statistics, which gives, as we think, a new insight into the problem.

Keywords

    Convergence in distribution, Exponential distribution, Order statistics, Probabilistic constructions, Quantile transformation, Sukhatme-Rényi representation

ASJC Scopus subject areas

Cite this

On the multiplicity of the maximum in a discrete random sample. / Bruss, F. Thomas; Grübel, Rudolf.
In: Annals of Applied Probability, Vol. 13, No. 4, 11.2003, p. 1252-1263.

Research output: Contribution to journalArticleResearchpeer review

Bruss FT, Grübel R. On the multiplicity of the maximum in a discrete random sample. Annals of Applied Probability. 2003 Nov;13(4):1252-1263. doi: 10.1214/aoap/1069786498
Bruss, F. Thomas ; Grübel, Rudolf. / On the multiplicity of the maximum in a discrete random sample. In: Annals of Applied Probability. 2003 ; Vol. 13, No. 4. pp. 1252-1263.
Download
@article{6829eeec624843adbea5524b5715d4e1,
title = "On the multiplicity of the maximum in a discrete random sample",
abstract = "Let Mn be the maximum of a sample X1,...,X n from a discrete distribution and let Wn be the number of i's, 1 ≤ i ≤ n, such that Xi=Mn. We discuss the asymptotic behavior of the distribution of Wn as n → ∞. The probability that the maximum is unique is of interest in diverse problems, for example, in connection with an algorithm for selecting a winner, and has been studied by several authors using mainly analytic tools. We present here an approach based on the Sukhatme-R{\'e}nyi representation of exponential order statistics, which gives, as we think, a new insight into the problem.",
keywords = "Convergence in distribution, Exponential distribution, Order statistics, Probabilistic constructions, Quantile transformation, Sukhatme-R{\'e}nyi representation",
author = "Bruss, {F. Thomas} and Rudolf Gr{\"u}bel",
year = "2003",
month = nov,
doi = "10.1214/aoap/1069786498",
language = "English",
volume = "13",
pages = "1252--1263",
journal = "Annals of Applied Probability",
issn = "1050-5164",
publisher = "Institute of Mathematical Statistics",
number = "4",

}

Download

TY - JOUR

T1 - On the multiplicity of the maximum in a discrete random sample

AU - Bruss, F. Thomas

AU - Grübel, Rudolf

PY - 2003/11

Y1 - 2003/11

N2 - Let Mn be the maximum of a sample X1,...,X n from a discrete distribution and let Wn be the number of i's, 1 ≤ i ≤ n, such that Xi=Mn. We discuss the asymptotic behavior of the distribution of Wn as n → ∞. The probability that the maximum is unique is of interest in diverse problems, for example, in connection with an algorithm for selecting a winner, and has been studied by several authors using mainly analytic tools. We present here an approach based on the Sukhatme-Rényi representation of exponential order statistics, which gives, as we think, a new insight into the problem.

AB - Let Mn be the maximum of a sample X1,...,X n from a discrete distribution and let Wn be the number of i's, 1 ≤ i ≤ n, such that Xi=Mn. We discuss the asymptotic behavior of the distribution of Wn as n → ∞. The probability that the maximum is unique is of interest in diverse problems, for example, in connection with an algorithm for selecting a winner, and has been studied by several authors using mainly analytic tools. We present here an approach based on the Sukhatme-Rényi representation of exponential order statistics, which gives, as we think, a new insight into the problem.

KW - Convergence in distribution

KW - Exponential distribution

KW - Order statistics

KW - Probabilistic constructions

KW - Quantile transformation

KW - Sukhatme-Rényi representation

UR - http://www.scopus.com/inward/record.url?scp=0346913253&partnerID=8YFLogxK

U2 - 10.1214/aoap/1069786498

DO - 10.1214/aoap/1069786498

M3 - Article

AN - SCOPUS:0346913253

VL - 13

SP - 1252

EP - 1263

JO - Annals of Applied Probability

JF - Annals of Applied Probability

SN - 1050-5164

IS - 4

ER -