On family trees and subtrees of simple branching processes (Q808106)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On family trees and subtrees of simple branching processes |
scientific article; zbMATH DE number 4209254
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On family trees and subtrees of simple branching processes |
scientific article; zbMATH DE number 4209254 |
Statements
On family trees and subtrees of simple branching processes (English)
0 references
1991
0 references
The family tree in a simple branching process initiated by a single ancestor is said to contain an N-ary subtree if a subtree can be found in which every individual has at least N offsprings. The second author [Am. Math. Monthly 98, 728-731 (1991)] previously studied the comparatively tractable case \(N=2\), showing how to obtain \(\tau\) (2), the probability of an infinite binary subtree. This paper studies the analogous \(\tau\) (N) for general N, obtaining a number of partial results and specialising to standard forms of offspring distributions such as Poisson for more detailed estimation, using numerical calculations for illustration.
0 references
branching process
0 references
binary subtree
0 references
numerical calculations
0 references