Answers are grounded in this paper and cite their sources.
By Ignatov's theorem the sets of values in an i.i.d. sequence that are thekth largest at their appearance (k= 1, 2, ···) are supports of i.i.d. Poisson processes. The present paper contains an elementary and short proof for the case where the underlying distribution functionFis discrete, and then extends the result to generalF.
No takes yet. Share an insight, caveat, or question.
Engelen et al. (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: