The degree profile of random Pólya trees

DOI10.1016/j.jcta.2012.04.007zbMath1245.05115arXiv1104.4271OpenAlexW2058208134MaRDI QIDQ439063

Veronika Kraus, Bernhard Gittenberger

Publication date: 1 August 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

profileBrownian excursionlocal timenodes of fixed degreeunlabelled trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geodesics in large planar maps and in the Brownian map
• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• The shape of unlabeled rooted random trees
• The continuum random tree. I
• Martingales and profile of binary search trees
• Profiles of random trees: Limit theorems for random recursive trees and binary search trees
• A functional limit theorem for the profile of \(b\)-ary trees
• Width and mode of the profile for some random trees of logarithmic height
• On the distribution of the number of vertices in layers of random trees
• Conditional limit theorems for branching processes
• The distribution of degrees in a large random tree
• An asymptotic evaluation of the cycle index of a symmetric group
• Branching processes, random trees, and a generalized scheme of arrangements of particles
• On the occupation time of Brownian excursion
• The distribution of time spent by a standard excursion above a given level, with applications to ring polymers near a discontinuity in potential
• On the local time density of the reflecting Brownian bridge
• Laws of large numbers and tail inequalities for random tries and PATRICIA trees
• Probabilistic and fractal aspects of Lévy trees
• The SDE solved by local times of a Brownian excursion or bridge derived from the height profile of a random tree or forest
• The profile of binary search trees
• On the local time of the Brownian motion
• The continuum random tree. III
• The topological structure of scaling limits of large planar maps
• Random real trees
• A functional limit theorem for the profile of search trees
• The number of trees
• The height of random binary unlabelled trees
• The distribution of height and diameter in random non-plane binary trees
• Profiles of random trees: Plane-oriented recursive trees
• Singularity Analysis of Generating Functions
• Random Trees
• Profiles of Tries
• On the Explicit Form of the Density of Brownian Excursion Local Time
• Brownian Excursion, the M/M/1 Queue and Their Occupation Times
• Excursions of Brownian motion and bessel processes
• The distribution of nodes of given degree in random trees
• On the profile of random trees
• On the covariance of the level sizes in random recursive trees
• The Brownian excursion multi-dimensional local time density
• The CRT is the scaling limit of unordered binary trees
• The Distribution of Patterns in Random Trees
• Nodes of large degree in random trees and forests
• Profiles of random trees: correlation and width of random recursive trees and binary search trees
• Brownian local times

This page was built for publication: The degree profile of random Pólya trees