Limit Distributions and Random Trees Derived from the Birthday Problem with Unequal Probabilities
Authors:
Open Access
- 1 January 2000
- journal article
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 5 (none) , 1-18
Abstract
Given an arbitrary distribution on a countable set, consider the number of independent samples required until the first repeated value is seen. Exact and asymptotic formulae are derived for the distribution of this time and of the times until subsequent repeats. Asymptotic properties of the repeat times are derived by embedding in a Poisson process. In particular, necessary and sufficient conditions for convergence are given and the possible limits explicitly described. Under the same conditions the finite dimensional distributions of the repeat times converge to the arrival times of suitably modified Poisson processes, and random trees derived from the sequence of independent trials converge in distribution to an inhomogeneous continuum random tree.Keywords
This publication has 18 references indexed in Scilit:
- Coalescent Random ForestsJournal of Combinatorial Theory, Series A, 1999
- Construction of Markovian coalescentsAnnales de l'Institut Henri Poincaré, Probabilités et Statistiques, 1998
- The general birthday problemRandom Structures & Algorithms, 1995
- The Continuum Random Tree IIIThe Annals of Probability, 1993
- The Continuum Random Tree. IThe Annals of Probability, 1991
- On a random mapping (T, Pj)Journal of Applied Probability, 1984
- Une théorie combinatoire des séries formellesAdvances in Mathematics, 1981
- A solution to the generalized birthday problem with application to allozyme screening for cell culture contaminationJournal of Applied Probability, 1979
- The distance between points in random treesJournal of Combinatorial Theory, 1970
- Zur Theorie der linearen IntegralgleichungenMathematische Zeitschrift, 1921