The Geometric Programming Dual to the Extinction Probability Problem in Simple Branching Processes

Abstract

It is shown that the well-known problem of determining the probability of extinction in a simple branching process has a duality relation to the problem of determining that offspring distribution which is in a sense closest to the original one and for which the new process is subcritical (or critical). The latter problem is also considered with respect to various measures of distance.