Pruned discrete random samples

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Autorschaft

  • Rudolf Grübel
  • Paweł Hitczenko

Externe Organisationen

  • Drexel University
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Seiten (von - bis)321-326
Seitenumfang6
FachzeitschriftElectronic Notes in Discrete Mathematics
Jahrgang44
Frühes Online-Datum4 Nov. 2013
PublikationsstatusVeröffentlicht - 5 Nov. 2013

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.

ASJC Scopus Sachgebiete

Zitieren

Pruned discrete random samples. / Grübel, Rudolf; Hitczenko, Paweł.
in: Electronic Notes in Discrete Mathematics, Jahrgang 44, 05.11.2013, S. 321-326.

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Grübel R, Hitczenko P. Pruned discrete random samples. Electronic Notes in Discrete Mathematics. 2013 Nov 5;44:321-326. Epub 2013 Nov 4. doi: 10.1016/j.endm.2013.10.050, 10.15488/2344
Grübel, Rudolf ; Hitczenko, Paweł. / Pruned discrete random samples. in: Electronic Notes in Discrete Mathematics. 2013 ; Jahrgang 44. S. 321-326.
Download
@article{bb252b4c96ea43d984d3587181d445f8,
title = "Pruned discrete random samples",
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.",
keywords = "Chinese restaurant process, Digital search trees, Geometric distribution, Maxima, Tail behaviour",
author = "Rudolf Gr{\"u}bel and Pawe{\l} Hitczenko",
year = "2013",
month = nov,
day = "5",
doi = "10.1016/j.endm.2013.10.050",
language = "English",
volume = "44",
pages = "321--326",
journal = "Electronic Notes in Discrete Mathematics",
publisher = "Elsevier",

}

Download

TY - JOUR

T1 - Pruned discrete random samples

AU - Grübel, Rudolf

AU - Hitczenko, Paweł

PY - 2013/11/5

Y1 - 2013/11/5

N2 - 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.

AB - 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.

KW - Chinese restaurant process

KW - Digital search trees

KW - Geometric distribution

KW - Maxima

KW - Tail behaviour

UR - http://www.scopus.com/inward/record.url?scp=84887178684&partnerID=8YFLogxK

U2 - 10.1016/j.endm.2013.10.050

DO - 10.1016/j.endm.2013.10.050

M3 - Article

AN - SCOPUS:84887178684

VL - 44

SP - 321

EP - 326

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

ER -