A 2-spine decomposition of the critical Galton-Watson tree and a probabilistic proof of Yaglom's theorem
From MaRDI portal
(Redirected from Publication:1663753)
Abstract: In this note we propose a two-spine decomposition of the critical Galton-Watson tree and use this decomposition to give a probabilistic proof of Yaglom's theorem.
Cites work
- scientific article; zbMATH DE number 1552341 (Why is no real title available?)
- scientific article; zbMATH DE number 3255217 (Why is no real title available?)
- scientific article; zbMATH DE number 3063407 (Why is no real title available?)
- Conceptual proofs of L L criteria for mean behavior of branching processes
- Elementary new proofs of classical limit theorems for Galton–Watson processes
- Functionals of critical multitype branching processes
- Limiting Distributions of the Distance to the Closest Common Ancestor
- The many-to-few lemma and multiple spines
- The survival probability of a critical multitype Galton-Watson branching process
Cited in
(10)- Limit theorems for a class of critical superprocesses with stable branching
- Conditional central limit theorem for critical branching random walk
- Spine decompositions and limit theorems for a class of critical superprocesses
- Rates on Yaglom's limit for Galton-Watson processes in a varying environment
- Yaglom's limit for critical Galton-Watson processes in varying environment: a probabilistic approach
- Yaglom limit for unimodal Lévy processes
- Convergence of genealogies through spinal decomposition with an application to population genetics
- The coalescent structure of continuous-time Galton-Watson trees
- Penalization of Galton-Watson processes
- Yaglom limit for critical nonlocal branching Markov processes
This page was built for publication: A 2-spine decomposition of the critical Galton-Watson tree and a probabilistic proof of Yaglom's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663753)