The geometric programming dual to the extinction probability problem in simple branching processes
From MaRDI portal
Publication:1158888
DOI10.1214/aop/1176994422zbMath0474.60069MaRDI QIDQ1158888
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
extinction probability; branching measure; geometric duality; infinite geometric program; Kullback directed divergence
60J80: Branching processes (Galton-Watson, birth-and-death, etc.)
94A17: Measures of information, entropy
Related Items
Path following in the exact penalty method of convex programming, A tutorial on geometric programming, MM algorithms for geometric and signomial programming