Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1016/j.endm.2013.10.050 | Electronic Notes in Discrete Mathematics |
Keywords | DocType | Volume |
Chinese restaurant process,digital search trees,geometric distribution,maxima,tail behaviour | Journal | 44 |
Issue | ISSN | Citations |
2 | 1571-0653 | 1 |
PageRank | References | Authors |
2.25 | 1 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Rudolf Grübel | 1 | 15 | 4.71 |
Pawel Hitczenko | 2 | 52 | 15.48 |