Fringe trees for random trees with given vertex degrees
From MaRDI portal
Cites work
- A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees
- Asymptotic fringe distributions for general families of random trees
- Asymptotic normality determined by high moments, and submap counts of random maps
- Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
- Central limit theorems for additive functionals and fringe trees in tries
- Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees
- scientific article; zbMATH DE number 1713116 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- scientific article; zbMATH DE number 1080355 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- Limit laws for functions of fringe trees for binary search trees and random recursive trees
- Limit laws for local counters in random binary search trees
- Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees
- Limit theorems for patterns in phylogenetic trees
- Limit theorems for subtree size profiles of increasing trees
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
- On the variety of shapes on the fringe of a random recursive tree
- Random Trees
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Vertices with fixed outdegrees in large Galton-Watson trees
This page was built for publication: Fringe trees for random trees with given vertex degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6865699)
