General branching processes in discrete time as random trees
From MaRDI portal
Publication:1002531
DOI10.3150/08-BEJ138zbMath1157.60338arXiv0811.2299OpenAlexW3098670679MaRDI QIDQ1002531
Publication date: 2 March 2009
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0811.2299
Related Items (4)
Critical Galton-Watson processes with overlapping generations ⋮ General linear-fractional branching processes with discrete time ⋮ Linear-fractional branching processes with countably many types ⋮ Perron–Frobenius theory for kernels and Crump–Mode–Jagers processes with macro-individuals
Cites Work
- Unnamed Item
- Unnamed Item
- Arbres et processus de Galton-Watson. (Trees and Galton-Watson processes)
- General branching processes as Markov fields
- How probable is it to be first born? and other branching-process applications to kinship problems
- Conceptual proofs of \(L\log L\) criteria for mean behavior of branching processes
- The growth and composition of branching populations
- On the convergence of supercritical general (C-M-J) branching processes
- Exact distributions of kin numbers in a Galton-Watson process
- The xlogx condition for general branching processes
- The stable doubly infinite pedigree process of supercritical branching populations
- Measure change in multitype branching
- Elementary new proofs of classical limit theorems for Galton–Watson processes
This page was built for publication: General branching processes in discrete time as random trees