Cost functionals for large (uniform and simply generated) random trees
DOI10.1214/18-EJP213zbMATH Open1398.05061OpenAlexW2963439863MaRDI QIDQ1990219FDOQ1990219
Authors: Jean-François Delmas, Jean-Stéphane Dhersin, Marion Sciauveau
Publication date: 25 October 2018
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ejp/1536717746
Recommendations
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Functional limit theorems; invariance principles (60F17) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Cites Work
- A new balance index for phylogenetic trees
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Title not available (Why is that?)
- Title not available (Why is that?)
- The contraction method for recursive algorithms
- Some Elementary Inequalities Relating to the Gamma and Incomplete Gamma Function
- A limit theorem for “quicksort”
- Wiener index of trees: Theory and applications
- Probabilistic and fractal aspects of Lévy trees
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random trees and applications
- Singularity analysis, Hadamard products, and tree recurrences
- The continuum random tree. III
- Limit laws for functions of fringe trees for binary search trees and random recursive trees
- Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
- Limiting distributions for additive functionals on Catalan trees
- Asymptotic fringe distributions for general families of random trees
- The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance
- The continuum random tree. I
- Arbres et processus de Galton-Watson. (Trees and Galton-Watson processes)
- Branching processes in Lévy processes: The exploration process
- Title not available (Why is that?)
- A limit theorem for the contour process of conditioned Galton-Watson trees
- A limiting distribution for quicksort
- The Wiener Index of simply generated random trees
- Title not available (Why is that?)
- The Galton-Watson process conditioned on the total progeny
- A simple proof of Duquesne's theorem on contour processes of conditioned Galton-Watson trees
- Invariance principles for Galton-Watson trees conditioned on the number of leaves
- The forest associated with the record process on a Lévy tree
- Record process on the continuum random tree
- Probability and real trees. Ecole d'Eté de Probabilités de Saint-Flour XXXV -- 2005. Lecture given at the Saint-Flour probability summer school, July 6--23, 2005.
- Total Path Length for Random Recursive Trees
- Limiting Distributions for Path Lengths in Recursive Trees
- The center of mass of the ISE and the Wiener index of trees
- Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
- On binary search tree recursions with monomials as toll functions
- Central limit theorems for additive tree parameters with small toll functions
- Limit theorems for conditioned non-generic Galton-Watson trees
- Local limits of conditioned Galton-Watson trees: the condensation case
- Local limits of conditioned Galton-Watson trees: the infinite spine case
- On the distribution of subtree orders of a tree
- Transfer theorems and asymptotic distributional results for m‐ary search trees
- On \(q\)-functional equations and excursion moments
- The uniform random tree in a Brownian excursion
- On the total heights of random rooted binary trees
- Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees
- Exact formulas for the variance of several balance indices under the Yule model
- Asymptotic cost of cutting down random free trees
- A repertoire for additive functionals of uniformly distributed \(m\)-ary search trees
Cited In (7)
- Zooming in at the root of the stable tree
- Asymptotic cost of cutting down random free trees
- Global regime for general additive functionals of conditioned Bienaymé-Galton-Watson trees
- A graphon counter example
- The sum of powers of subtree sizes for conditioned Galton-Watson trees
- Protection numbers in simply generated trees and Pólya trees
- Title not available (Why is that?)
This page was built for publication: Cost functionals for large (uniform and simply generated) random trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1990219)