The geometric programming dual to the extinction probability problem in simple branching processes

DOI10.1214/aop/1176994422zbMath0474.60069OpenAlexW2074899312MaRDI QIDQ1158888

Ury Passy, Paul D. Feigin

Publication date: 1981

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1176994422

zbMATH Keywords

extinction probabilitybranching measuregeometric dualityinfinite geometric programKullback directed divergence

Mathematics Subject Classification ID

Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Measures of information, entropy (94A17)

Related Items (3)

MM algorithms for geometric and signomial programming ⋮ Path following in the exact penalty method of convex programming ⋮ A tutorial on geometric programming

This page was built for publication: The geometric programming dual to the extinction probability problem in simple branching processes