On the profile of random trees
From MaRDI portal
Recommendations
Cited in
(46)- Applications of the theory of records in the study of random trees
- Generalized covariances of multi-dimensional Brownian excursion local times.
- The depth first processes of Galton-Watson trees converge to the same Brownian excursion
- Strata of random mappings---a combinatorial approach
- Profile of random exponential binary trees
- Reflected Brownian bridge local time conditioned on its local time at the origin
- The SDE solved by local times of a Brownian excursion or bridge derived from the height profile of a random tree or forest
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
- Random real trees
- Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
- The Gorin-Shkolnikov identity and its random tree generalization
- Profile of random exponential recursive trees
- Limit theorems for subtree size profiles of increasing trees
- Canonical trees, compact prefix-free codes, and sums of unit fractions: a probabilistic analysis
- Branching random walks on binary search trees: convergence of the occupation measure
- Functional limit theorems for the decomposable branching process with two types of particles
- scientific article; zbMATH DE number 7234299 (Why is no real title available?)
- On the local profiles of trees
- On the shape of the fringe of various types of random trees
- A Lamperti-type representation of continuous-state branching processes with immigration
- The shape of random pattern-avoiding permutations
- scientific article; zbMATH DE number 140559 (Why is no real title available?)
- scientific article; zbMATH DE number 1222137 (Why is no real title available?)
- The degree profile of random Pólya trees
- Noncrossing trees are almost conditioned Galton–Watson trees
- The vertical profile of embedded trees
- On the Contour of Random Trees
- scientific article; zbMATH DE number 1418385 (Why is no real title available?)
- Random walks with preferential relocations and fading memory: a study through random recursive trees
- Analytical results for the in-degree and out-degree distributions of directed random networks that grow by node duplication
- Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees
- Shape measures of random increasing k-trees
- The profile of unlabeled trees
- The distance profile of rooted and unrooted simply generated trees
- On breadth‐first constructions of scaling limits of random graphs and random unicellular maps
- Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication
- The GHP scaling limit of uniform spanning trees in high dimensions
- Scale free properties of random \(k\)-trees
- Voronoi cells in random split trees
- A random recursive tree model with doubling events
- Note on the density of ISE and a related diffusion
- The shape of unlabeled rooted random trees
- A functional limit theorem for decomposable branching processes with two particle types
- The density of the ISE and local limit laws for embedded trees
- The power of choice in growing trees
- A functional limit theorem for the profile of \(b\)-ary trees
This page was built for publication: On the profile of random trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345362)