Trickle-down processes and their boundaries

DOI10.1214/EJP.v17-1698zbMath1246.60100arXiv1010.0453OpenAlexW2121113001MaRDI QIDQ428599

Anton Wakolbinger, Rudolf Grübel, Steven N. Evans

Publication date: 22 June 2012

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.0453

zbMATH Keywords

quincunxCatalan numberharmonic functionPoisson boundarycompositionEwens sampling formulabinary search tree\(h\)-transformChinese restaurant process\(q\)-binomial theoremMallows modelinternal diffusion limited aggregationrandom recursive treedigital search treeDirichlet random measureGriffiths-Engen-McCloskey distributionrandom partitiontail \(\sigma \)-field

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random measures (60G57) Boundary theory for Markov processes (60J50)

Related Items (8)

Pruned Discrete Random Samples ⋮ The height of record‐biased trees ⋮ Sampling and learning Mallows and generalized Mallows models under the Cayley distance ⋮ Combinatiorial Markov chains ⋮ Refined asymptotics for the composition of cyclic urns ⋮ Search trees: metric aspects and strong limit theorems ⋮ The height of Mallows trees ⋮ Refined quicksort asymptotics

This page was built for publication: Trickle-down processes and their boundaries