Branching Processes That Grow Faster Than Binary Splitting
From MaRDI portal
When does the founder of a branching process give rise to a binary tree? The probability of the complement of this event is the smallest root in \([0,1]\) of \(f(x)+(1-x)f'(x)=x\), where \(f\) is the offspring generating function. An example shows that this probability can depend discontinuously on the offspring distribution, giving a kind of critical phenomenon. The study started here is taken further in [\textit{A. G. Pakes} and \textit{F. M. Dekking}, J. Theor. Probab. 4, No. 2, 353-369 (1991; Zbl 0731.60076)].
Recommendations
Cited in
(6)- Number of complete \(N\)-ary subtrees on Galton-Watson family trees
- Annihilation and coalescence on binary trees
- Continuous phase transitions on Galton–Watson trees
- Galton–Watson games
- Survival probabilities for N-ary subtrees on a Galton-Watson family tree
- On family trees and subtrees of simple branching processes
This page was built for publication: Branching Processes That Grow Faster Than Binary Splitting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3986354)