The shape of unlabeled rooted random trees
From MaRDI portal
Publication:710724
DOI10.1016/j.ejc.2010.05.011zbMath1221.05047arXiv1003.1322OpenAlexW2012043261WikidataQ60692175 ScholiaQ60692175MaRDI QIDQ710724
Michael Drmota, Bernhard Gittenberger
Publication date: 22 October 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.1322
Related Items
Scaling limits of random Pólya trees ⋮ Graphon convergence of random cographs ⋮ On the Wiener index of random trees ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ On the shape of random Pólya structures ⋮ Central Limit Theorems for Additive Tree Parameters with Small Toll Functions ⋮ The degree profile of random Pólya trees ⋮ The number of rooted trees of given depth ⋮ Decomposing almost complete graphs by random trees ⋮ Decomposing almost complete graphs by random trees ⋮ Almost Every Tree With m Edges Decomposes K2m,2m ⋮ Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
Uses Software
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- On Robson's convergence and boundedness conjectures concerning the height of binary search trees
- Profiles of random trees: Limit theorems for random recursive trees and binary search trees
- Width and mode of the profile for some random trees of logarithmic height
- Bandwidths and profiles of trees
- The average height of binary trees and other simple trees
- 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
- Branching processes, random trees, and a generalized scheme of arrangements of particles
- 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
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
- The number of trees
- The height of random binary unlabelled trees
- Profiles of random trees: Plane-oriented recursive trees
- Singularity Analysis of Generating Functions
- Random Trees
- On the Explicit Form of the Density of Brownian Excursion Local Time
- Brownian Excursion, the M/M/1 Queue and Their Occupation Times
- On the Altitude of Nodes in Random Trees
- Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
- The distribution of nodes of given degree in random trees
- The Distribution of Heights of Binary Trees and Other Simple 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
- Bimodality and Phase Transitions in the Profile Variance of Random Binary Search 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