Details
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 1252-1263 |
| Seitenumfang | 12 |
| Fachzeitschrift | Annals of Applied Probability |
| Jahrgang | 13 |
| Ausgabenummer | 4 |
| Publikationsstatus | Veröffentlicht - 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.
ASJC Scopus Sachgebiete
- Mathematik (insg.)
- Statistik und Wahrscheinlichkeit
- Entscheidungswissenschaften (insg.)
- Statistik, Wahrscheinlichkeit und Ungewissheit
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: Annals of Applied Probability, Jahrgang 13, Nr. 4, 11.2003, S. 1252-1263.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
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 -