Parking functions, empirical processes, and the width of rooted labeled trees
From MaRDI portal
Publication:5928528
zbMath0974.05025MaRDI QIDQ5928528
Jean-François Marckert, Philippe Chassaing
Publication date: 29 March 2001
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/121402
Brownian excursionempirical processeshashing with linear probingmomentparkingrooted labelled treewidth
Trees (05C05) Brownian motion (60J65) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items (13)
A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0 ⋮ Probabilizing parking functions ⋮ The distribution of height and diameter in random non-plane binary trees ⋮ Deviation results for sparse tables in hashing with linear probing ⋮ The Gorin-Shkolnikov identity and its random tree generalization ⋮ Parking functions: interdisciplinary connections ⋮ Parking functions, multi-shuffle, and asymptotic phenomena ⋮ Parking functions: from combinatorics to probability ⋮ Models of random subtrees of a graph ⋮ Asymptotic behaviour of the first positions of uniform parking functions ⋮ The depth first processes of Galton-Watson trees converge to the same Brownian excursion ⋮ Reinforced weak convergence of stochastic processes ⋮ Cycle structure of random parking functions
This page was built for publication: Parking functions, empirical processes, and the width of rooted labeled trees
