Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-28T19:59:30.878Z Has data issue: false hasContentIssue false
  • English
  • Français

Bounds for the extinction probability of a simple branching process

Published online by Cambridge University Press:  14 July 2016

M. P. Quine
M. P. Quine*
Affiliation:
University of Sydney
Get access Rights & Permissions [Opens in a new window]

Abstract

The extinction probability q of a supercritical simple branching process is well known to be less than unity. Intuitively, it is apparent that when the offspring mean is close to one, so, usually, will q be. This notion is made rigorous, and simple bounds are given for q in terms of the second and third factorial moments, which are applicable when the offspring mean is close to unity. A comparison is made of various upper bounds for q. The note contains some numerical examples.

Keywords

BRANCHING PROCESSGALTON–WATSONEXTINCTION PROBABILITYBOUNDSMOMENTSQUEUEING THEORY
Type
Research Papers
Information
Journal of Applied Probability , Volume 13 , Issue 1 , March 1976 , pp. 9 - 16
Copyright
Copyright © Applied Probability Trust 1976 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Brook, D. (1966) Bounds for moment generating functions and for extinction probabilities. J. Appl. Prob. 3, 171–178.CrossRefGoogle Scholar
[2] Chaudhry, M. L. and Templeton, J. G. C. (1973) Bounds for the least positive root of a characteristic equation in the theory of queues. Infor. 11, 177–179.Google Scholar
[3] Fahady, K. S., Quine, M. P. and Vere-Jones, D. (1971) Heavy traffic approximations for the Galton-Watson process. Adv. Appl. Prob. 3, 282–300.CrossRefGoogle Scholar
[4] Harris, T. E. (1963) The Theory of Branching Processes. Springer, New York.CrossRefGoogle Scholar
[5] Nagaev, S. V. and Muhammedhanova, R. (1966) Transitional phenomena in branching stochastic processes with discrete time. Limit Theorems and Statistical Inference, FAN, Uzbekskei S.S.R., Tashkent, 46–49.Google Scholar
[6] Şahin, İ. (1970) On the least positive root of the equation z = K (z) in queueing theory. CORS J. 8, 109–115.Google Scholar