Chinese restaurant process digital search trees geometric distribution maxima tail behaviour
Let Xi,i∈N, be independent and identically distributed random variables with values in N0. We transform (‘prune’) the sequence {X1,…,Xn},n∈N, of discrete random samples into a sequence {0,1,2,…,Yn},n∈N, of contiguous random sets by replacing Xn+1 with Yn+1 if Xn+1>Yn. We consider the asymptotic behaviour of Yn as n→∞. Applications include path growth in digital search trees and the number of tables in Pitmanʼs Chinese restaurant process if the latter is conditioned on its limit value.
Metrics
8 Record Views
Details
Title
Pruned discrete random samples
Creators
Rudolf Grübel - Leibniz University Hannover
Paweł Hitczenko - Drexel University
Publication Details
Electronic notes in discrete mathematics, v 44, pp 321-326