scientific article; zbMATH DE number 15993

From MaRDI portal
Publication:3972640





[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)].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972640)