Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set
From MaRDI portal
Publication:2346182
Abstract: We generalize recent results of Haas and Miermont to obtain scaling limits of Markov branching trees whose size is specified by the number of nodes whose out-degree lies in a given set. We then show that this implies that the scaling limit of finite variance Galton-Watson trees condition on the number of nodes whose out-degree lies in a given set is the Brownian continuum random tree. The key to this is a generalization of the classical Otter-Dwass formula.
Recommendations
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- Scaling Limits of Markov-Branching Trees and Applications
- Scaling limits of multi-type Markov branching trees
- A note on the scaling limits of contour functions of Galton-Watson trees
- Scaling limits of random trees and random graphs
- Scaling limit of random k-trees
- Scaling limits of random trees and graphs
- Scaling limits of tree-valued branching random walks
- On scaling limits of random trees and maps with a prescribed degree sequence
- Scaling limits of k-ary growing trees
Cites work
- Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic mod\-els
- Invariance principles for Galton-Watson trees conditioned on the number of leaves
- Itô's excursion theory and random trees
- Local limits of conditioned Galton-Watson trees: the infinite spine case
- On the number of vertices with a given degree in a Galton-Watson tree
- Random Fragmentation and Coagulation Processes
- Random real trees
- Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- The continuum random tree. III
- The genealogy of self-similar fragmentations with negative index as a continuum random tree
Cited in
(28)- Critical multi-type Galton-Watson trees conditioned to be large
- Scaling limits for some random trees constructed inhomogeneously
- Scaling limits of multi-type Markov branching trees
- Limits of random tree-like discrete structures
- On the maximal offspring in a subcritical branching process
- Inverting the cut-tree transform
- Limit theorems for conditioned non-generic Galton-Watson trees
- Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set
- The height of the latest common ancestor of two randomly chosen leaves from a (sub-)critical Galton-Watson tree
- Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of \(n\)-leaf Galton-Watson trees
- Random non-crossing plane configurations: a conditioned Galton-Watson tree approach
- Schröder's problems and scaling limits of random trees
- The CRT is the scaling limit of random dissections
- Dissecting the circle, at random
- On scaling limits of planar maps with stable face-degrees
- Local limits of Galton–Watson trees conditioned on the number of protected nodes
- Asymptotics of trees with a prescribed degree sequence and applications
- A branching process approach to level‐k phylogenetic networks
- Exact-Size Sampling of Enriched Trees in Linear Time
- Scaling limits of slim and fat trees
- Scaling Limits of Markov-Branching Trees and Applications
- Large deviation local limit theorems and limits of biconditioned planar maps
- Scaling limits of random looptrees and bipartite plane maps with prescribed large faces
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- Conditioning Bienaymé-Galton-Watson trees to have large sub-populations
- The scaling limit of random two-connected series-parallel maps
- Vertices with fixed outdegrees in large Galton-Watson trees
- A decorated tree approach to random permutations in substitution-closed classes
This page was built for publication: Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346182)