On scaling limits of multitype Galton-Watson trees with possibly infinite variance
From MaRDI portal
Publication:4601285
zbMath1378.60110arXiv1605.04810MaRDI QIDQ4601285
Publication date: 15 January 2018
Full work available at URL: https://arxiv.org/abs/1605.04810
Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Functional limit theorems; invariance principles (60F17)
Related Items
Random stable-type minimal factorizations of the n-cycle, Scaling Limits of Markov-Branching Trees and Applications, Population dynamics and statistical physics in synergy. Abstracts from the workshop held March 6--12, 2022, Totally ordered measured trees and splitting trees with infinite variation, Scaling limits of multi-type Markov branching trees, The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees, A decorated tree approach to random permutations in substitution-closed classes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangulating stable laminations
- Invariance principles for Galton-Watson trees conditioned on the number of leaves
- Scaling limit of multitype Galton-Watson trees with infinitely many types
- Scaling limits of random planar maps with large faces
- Invariance principles for spatial multitype Galton-Watson trees
- Percolation on random triangulations and stable looptrees
- The continuum random tree. I
- Random trees and applications
- General branching processes as Markov fields
- On the exact asymptotic behaviour of the distribution of ladder epochs
- A limit theorem for the contour process of conditioned Galton-Watson trees
- Scaling limits of random planar maps with a unique large face
- Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
- The continuum random tree. III
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- A Simple Proof of Duquesne’s Theorem on Contour Processes of Conditioned Galton–Watson Trees
- $\beta$-coalescents and stable Galton-Watson trees
- Simply Generated Non-Crossing Partitions