ABSTRACT


Recursive Sampling Formulas
Alexander Gnedin, March 5, 2003
We represent an infinite population partitioned into distinct (ordered) types by a random closed subset S of [0,1], with component intervals of [0,1]\S being interpreted as frequencies of the types. A random integer composition appears when a finite sample is drawn from the population. We are interested in S obtained by a random recursive construction and argue that in some cases the finite compositions can inherit the recursive structure from S.
Back to the history of the seminar or the Colloquium Stochastiek homepage.
Martijn Pistorius (pistorius@math.uu.nl)