No label defined (Q3972640)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 15993
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 15993 |
Statements
25 June 1992
0 references
first birth
0 references
algorithms
0 references
age-dependent branching process
0 references
0.7343537211418152
0 references
0.7294260859489441
0 references
0.7259969115257263
0 references
[For the entire collection see Zbl 0714.00019.] Suppose the birth times in an age-dependent branching process correspond to the cost of the associated node in the family tree. Finding the first birth in the \(n\)-th generation then corresponds to finding the cheapest node of depth \(n\). This paper studies certain algorithms for finding a node of (nearly) optimal cost of depth \(n\). Naturally the paper draws heavily on known results for the age-dependent branching process, in particular on the results of \textit{J. F. C. Kingman} [Ann. of Probab. 3, 790-801 (1975; Zbl 0325.60079)].
0 references
