Bounds on the extinction time distribution of a branching process

1974 ◽  
Vol 6 (2) ◽  
pp. 322-335 ◽  
Author(s):  
Alan Agresti
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Time Distribution ◽  
Branching Process ◽  
Probability Generating Function ◽  
Extinction Time ◽  
Expected Time ◽  
Time To Extinction ◽  
Special Case ◽  
Better Than

The class of fractional linear generating functions, one of the few known classes of probability generating functions whose iterates can be explicitly stated, is examined. The method of bounding a probability generating function g (satisfying g″(1) < ∞) by two fractional linear generating functions is used to derive bounds for the extinction time distribution of the Galton-Watson branching process with offspring probability distribution represented by g. For the special case of the Poisson probability generating function, the best possible bounding fractional linear generating functions are obtained, and the bounds for the expected time to extinction of the corresponding Poisson branching process are better than any previously published.

Bounds on the extinction time distribution of a branching process

1974 ◽  
Vol 6 (02) ◽  
pp. 322-335 ◽  
Author(s):  
Alan Agresti
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Time Distribution ◽  
Branching Process ◽  
Probability Generating Function ◽  
Extinction Time ◽  
Expected Time ◽  
Time To Extinction ◽  
Special Case ◽  
Better Than

The class of fractional linear generating functions, one of the few known classes of probability generating functions whose iterates can be explicitly stated, is examined. The method of bounding a probability generating function g (satisfying g″(1) &lt; ∞) by two fractional linear generating functions is used to derive bounds for the extinction time distribution of the Galton-Watson branching process with offspring probability distribution represented by g. For the special case of the Poisson probability generating function, the best possible bounding fractional linear generating functions are obtained, and the bounds for the expected time to extinction of the corresponding Poisson branching process are better than any previously published.

On best fractional linear generating function bounds

1979 ◽  
Vol 16 (2) ◽  
pp. 449-453 ◽  
Author(s):  
Tea-Yuan Hwang ◽  
Nae-Sheng Wang
Keyword(s):  
Generating Function ◽  
Time Distribution ◽  
Branching Process ◽  
Probability Generating Function ◽  
Extinction Time ◽  
Special Case ◽  
Parameters Of Interest ◽  
Better Than

Under weak conditions, this paper provides a best lower and a best upper bounding fractional linear generating function for any probability generating function when they have the same mean. These bounds can be used to obtain bounds for the expectation and the percentiles of the extinction-time distribution of a Galton-Watson branching process and other parameters of interest. For the special case of the four points probability generating function, the best bounds obtained are better than the bounds derived by Agresti (1974).

On best fractional linear generating function bounds

1979 ◽  
Vol 16 (02) ◽  
pp. 449-453 ◽  
Author(s):  
Tea-Yuan Hwang ◽  
Nae-Sheng Wang
Keyword(s):  
Generating Function ◽  
Time Distribution ◽  
Branching Process ◽  
Probability Generating Function ◽  
Extinction Time ◽  
Special Case ◽  
Parameters Of Interest ◽  
Better Than

Under weak conditions, this paper provides a best lower and a best upper bounding fractional linear generating function for any probability generating function when they have the same mean. These bounds can be used to obtain bounds for the expectation and the percentiles of the extinction-time distribution of a Galton-Watson branching process and other parameters of interest. For the special case of the four points probability generating function, the best bounds obtained are better than the bounds derived by Agresti (1974).

Polynomial bounds for probability generating functions

1975 ◽  
Vol 12 (3) ◽  
pp. 507-514 ◽  
Author(s):  
Henry Braun
Keyword(s):  
Lower Bound ◽  
Generating Function ◽  
Generating Functions ◽  
Branching Process ◽  
Probability Generating Function ◽  
Extinction Time ◽  
Probability Generating Functions ◽  
Extinction Probabilities ◽  
Polynomial Bounds

The problem of approximating an arbitrary probability generating function (p.g.f.) by a polynomial is considered. It is shown that if the coefficients rj are chosen so that LN(·) agrees with g(·) to k derivatives at s = 1 and to (N – k) derivatives at s = 0, then LN is in fact an upper or lower bound to g; the nature of the bound depends only on k and not on N. Application of the results to the problems of finding bounds for extinction probabilities, extinction time distributions and moments of branching process distributions are examined.

Inequalities for branching processes

1966 ◽  
Vol 3 (01) ◽  
pp. 261-267 ◽  
Author(s):  
C. R. Heathcote ◽  
E. Seneta
Keyword(s):  
Generating Function ◽  
Conditional Distribution ◽  
Branching Process ◽  
Branching Processes ◽  
Probability Generating Function ◽  
Random Variable ◽  
Expected Time ◽  
Time To Extinction ◽  
Explicit Formulae

Summary If F(s) is the probability generating function of a non-negative random variable, the nth functional iterate Fn (s) = Fn– 1 (F(s)) generates the distribution of the size of the nth generation of a simple branching process. In general it is not possible to obtain explicit formulae for many quantities involving Fn (s), and this paper considers certain bounds and approximations. Bounds are found for the Koenigs-type iterates lim n→∞ m −n {1−Fn (s)}, 0 ≦ s ≦ 1 where m = F′ (1) &lt; 1 and F′′ (1) &lt; ∞; for the expected time to extinction and for the limiting conditional-distribution generating function limn→∞{Fn (s) − Fn (0)} [1 – Fn (0)]–1. Particular attention is paid to the case F(s) = exp {m(s − 1)}.

Polynomial bounds for probability generating functions

1975 ◽  
Vol 12 (03) ◽  
pp. 507-514 ◽  
Author(s):  
Henry Braun
Keyword(s):  
Lower Bound ◽  
Generating Function ◽  
Generating Functions ◽  
Branching Process ◽  
Probability Generating Function ◽  
Extinction Time ◽  
Probability Generating Functions ◽  
Extinction Probabilities ◽  
Polynomial Bounds

The problem of approximating an arbitrary probability generating function (p.g.f.) by a polynomial is considered. It is shown that if the coefficients rj are chosen so that LN (·) agrees with g(·) to k derivatives at s = 1 and to (N – k) derivatives at s = 0, then LN is in fact an upper or lower bound to g; the nature of the bound depends only on k and not on N. Application of the results to the problems of finding bounds for extinction probabilities, extinction time distributions and moments of branching process distributions are examined.

Inequalities for branching processes

1966 ◽  
Vol 3 (1) ◽  
pp. 261-267 ◽  
Author(s):  
C. R. Heathcote ◽  
E. Seneta
Keyword(s):  
Generating Function ◽  
Conditional Distribution ◽  
Branching Process ◽  
Branching Processes ◽  
Probability Generating Function ◽  
Random Variable ◽  
Expected Time ◽  
Time To Extinction ◽  
Explicit Formulae

SummaryIf F(s) is the probability generating function of a non-negative random variable, the nth functional iterate Fn(s) = Fn–1 (F(s)) generates the distribution of the size of the nth generation of a simple branching process. In general it is not possible to obtain explicit formulae for many quantities involving Fn(s), and this paper considers certain bounds and approximations. Bounds are found for the Koenigs-type iterates limn→∞m−n {1−Fn(s)}, 0 ≦ s ≦ 1 where m = F′(1) < 1 and F′′(1) < ∞; for the expected time to extinction and for the limiting conditional-distribution generating function limn→∞{Fn(s) − Fn(0)} [1 – Fn(0)]–1. Particular attention is paid to the case F(s) = exp {m(s − 1)}.

scholarly journals Period-Life of a Branching Process with Migration and Continuous Time

Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 868
Author(s):  
Khrystyna Prysyazhnyk ◽  
Iryna Bazylevych ◽  
Ludmila Mitkova ◽  
Iryna Ivanochko
Keyword(s):  
Random Process ◽  
Generating Function ◽  
Continuous Time ◽  
Branching Process ◽  
Probability Generating Function ◽  
Time Interval ◽  
The Moment ◽  
First Time ◽  
Critical Branching Process ◽  
Number Of Particles

The homogeneous branching process with migration and continuous time is considered. We investigated the distribution of the period-life τ, i.e., the length of the time interval between the moment when the process is initiated by a positive number of particles and the moment when there are no individuals in the population for the first time. The probability generating function of the random process, which describes the behavior of the process within the period-life, was obtained. The boundary theorem for the period-life of the subcritical or critical branching process with migration was found.

scholarly journals Single server queues with modified service mechanisms

1962 ◽  
Vol 2 (4) ◽  
pp. 499-507 ◽  
Author(s):  
G. F. Yeo
Keyword(s):  
Time Distribution ◽  
Busy Period ◽  
Queueing System ◽  
Probability Generating Function ◽  
Single Server ◽  
Waiting Time Distribution ◽  
Period Distribution ◽  
Time Dependent Problem ◽  
Stationary Waiting Time ◽  
Special Case

SummaryThis paper considers a generalisation of the queueing system M/G/I, where customers arriving at empty and non-empty queues have different service time distributions. The characteristic function (c.f.) of the stationary waiting time distribution and the probability generating function (p.g.f.) of the queue size are obtained. The busy period distribution is found; the results are generalised to an Erlangian inter-arrival distribution; the time-dependent problem is considered, and finally a special case of server absenteeism is discussed.

Sign in / Sign up

Export Citation Format

Share Document