Skip to main content
NIHPA Author Manuscripts logoLink to NIHPA Author Manuscripts
. Author manuscript; available in PMC: 2019 May 29.
Published in final edited form as: J Appl Probab. 2017 Jun 22;54(2):569–587. doi: 10.1017/jpr.2017.18

Subcritical Sevastyanov branching processes with nonhomogeneous Poisson immigration

OLLIVIER HYRIEN 1,*, KOSTO V MITOV 2,**, NIKOLAY M YANEV 3,***
PMCID: PMC6540977  NIHMSID: NIHMS925745  PMID: 31156271

Abstract

We consider a class of Sevastyanov branching processes with non-homogeneous Poisson immigration. These processes relax the assumption required by the Bellman-Harris process which imposes the lifespan and offspring of each individual to be independent. They find applications in studies of the dynamics of cell populations. In this paper, we focus on the subcritical case and examine asymptotic properties of the process. We establish limit theorems, which generalize classical results due to Sevastyanov and others. Our key findings include novel LLN and CLT which emerge from the non-homogeneity of the immigration process.

Keywords: Branching processes, Immigration, Poisson process, Limit theorems

2010 Mathematics Subject Classification: Primary 60J80, Secondary 60F05, 60J85, 62P10

1. Introduction

Age-dependent branching processes with immigration are well-suited to describe the temporal evolution of populations in which individuals (for example cells) appear randomly over time in accordance with two distinct mechanisms. One mechanism, called immigration, is the influx of new individuals in the population of which they are not natives. The other mechanism, referred to as branching, is the process by which individuals of the population generate new offspring. These models have attracted much attention since Sevastyanov’s seminal work on continuous-time Markov branching processes with immigration [29]. Jagers [17] established asymptotic properties in the age-dependent (Bellman-Harris) case. Other properties, also for Bellman-Harris processes, were subsequently proven by Radcliffe [28], Pakes and Kaplan [27], Kaplan and Pakes [19], among others. Olofsson considered a process with a more general branching mechanism [25]. These articles dealt with time-homogeneous immigration processes, and Mitov and Yanev [21, 22, 23] investigated a Bellman-Harris process with state-dependent immigration (see also [1], Ch. 3). Age-dependent branching processes with immigration have been proposed to study the dynamics of cell populations developing in vivo [33, 34, 11, 14, 12, 13]. We refer to [6, 32, 3, 18, 2, 1] for general monographs on branching processes.

In this paper, we consider a class of age-dependent branching processes with immigration, in which: (i) the branching mechanism obeys the assumptions of a Sevastyanov process [25, 26, 27], an extension of the Bellman-Harris process which allows lifespan and offspring to be dependent; (ii) the immigration process is time-inhomogeneous. These two extensions are motivated in Section 2 using a cell biology example. Mitov and Yanev [24] and Hyrien et al. [15] studied critical processes for various intensities of the nonhomogeneous Poisson immigration process, while Hyrien et al. [16] investigated the supercritical case. Pakes [26] considered critical and subcritical Bellman-Harris processes with a non-homogeneous Poisson immigration process that converges weakly to an homogeneous Poisson process. Yanev [35, 36] studied the Sevastyanov process when immigration is time-homogeneous. Here, we investigate the subcritical case which is adapted to model the dynamics of terminally differentiated cells.

The asymptotic properties are studied when the intensity of the Poisson immigration process belongs to the class of power and exponential functions.

The process is formulated in Section 3. The asymptotic behavior of its expectation and variance-covariance function is investigated in Section 4. All other limit theorems are stated in Section 5. The conditional limiting distributions of Theorems 5.1, 5.2, and 5.3 are akin to those that have been established for continuous-time branching processes without immigration (e.g., [6, 32, 3, 18, 2, 1]). Theorems 5.4–5.7 uncover behaviors in the form of LLN and CLT that are novel for branching processes and which arise from the non-homogeneity of the immigration process. Theorem 5.8 generalizes a classical result due to Sevastyanov [29] to the more general setting considered herein.

2. A biological motivation

The molecular events and pathways that control cell fate decision (e.g., division, death, differentiation) in multi-cellular systems are not well understood and the subject of intensive basic science research. Experimental set-ups used in these studies often yield observations about the composition of the system at discrete time points only. A viable approach to inferring about cell fate on the basis of such data consists in modeling the dynamics of the cell population in order to relate experimental observations to (unobserved) cell cycle outcomes. Key to the success of this approach is an appropriate modeling framework in which the most prominent features of cell proliferation are properly captured. The Bellman-Harris process has been successfully used to develop stochastic models in this context. However, the rise of high-throughput, high-dimensional data produced by modern technologies (e.g., flow cytometry, imaging, sequencing) permits a wealth of cellular information to be produced at the single-cell resolution. This information allows teasing apart more subtle models.

An assumption that is central to the make-up of the Bellman-Harris process is that the duration of the lifespan, η, and the number of daughters, ξ, of any cell of the population are independent random variables. This assumption was found inadequate in several studies [7, 8, 9, 10, 5]. One of these studies investigated the generation of terminally differentiated oligodendrocytes from their progenitor cells (PC), known as the oligodendrocytes type-2 astrocytes PC [8]. These cells of the central nervous system produce the myelin sheath that insulate axons which conducts electrical impulses to transmit information between neurons. It was observed in this study that the time to division, the time to death, and the time to differentiation of these cells into oligodendrocytes had dissimilar distributions and that these distributions could be differentially affected by exposure to external signals (see Fig. 1). This finding may be explained by the fact that fate-specific molecular events are triggered in order for cells to reach their ultimate transformation. It also reflects the fact that the time at which a specific fate is detected may be arbitrary and depends on the experimental set-up that is used. The time at which a cell divides may be unambiguously defined as the time at which it splits into two daughter cells at the end of cytokinesis. However, the definition of the time at which a cell dies is debatable because the event that leads to the ultimate disintegration of the cell is not observable, and the time of cell death is instead defined as the time at which an outcome of death (e.g., fragmentation of the cell membrane) becomes experimentally detectable. Relaxing the assumption of independence between η and ξ yields the class of Sevastyanov processes.

Figure 1.

Figure 1

Kernel density estimates of the distributions of the time to differentiation, the time to division, and the time to death of O-2A/OPCs in the presence (right) and in the absence (left) of thyroid hormone observed in time-lapse experiments (Hyrien et al, [8]). The plots indicate that the distribution of the lifespan depended on the fate of the cell (here: differentiation, division, or death), and that these distributions were affected by thyroid hormone. For example, the presence of thyroid hormone appeared to shorten the time to differentiation and increase the time to death and the time to division. Unlike the Bellman-Harris process, the Sevastyanov process is adapted to describe these features of the cell cycle.

Populations of lineage-committed progenitor cells that develop in vivo are sustained by influxes of differentiated cells produced by multipotent stem or progenitor cells. This mechanism ensures the maintenance of terminally differentiated tissues which have limited self-renewing capabilities. The influx may vary over time. For example, it may temporarily increase in order to accelerate the repair of damaged downstream cellular compartments. The dynamics of such systems may be described by subcritical branching processes with time-inhomogeneous immigration. Here we ask whether the distribution of the population size can be characterized. We find that the process is asymptotically normal when immigration increases over time under mild assumptions.

To avoid modeling the influx of new cells as a Poisson process, cell kinetics could be alternatively formulated as a two-type reducible Sevastyanov branching process in which the first type of cells would correspond to (unobservable) upstream stem and progenitor cells, while the second one would describe the pool of observable cells (Fig. 2; see also Kesten and Stigum [20] for a discrete-time version of the process). While conceptually simple, this formulation presents several drawbacks, including:

Figure 2.

Figure 2

Left: schematic representation of a population consisting of two types of cells: those in Box B are observed, and those in Box A are unobservable but contribute to the observed population (Box B) via immigration. Our process does not describe population dynamics within Box A, but formulates the influx of cells from Box A into Box B as a non-homogeneous Poisson process, and model the dynamics within Box B as a Sevastyanov process. Right: an example of branching mechanism allowed by the process in which a cell may either die or divide; the Sevastyanov process allows the probabilities of division and death to depend on the age of the cell. For instance, cell death may occur stochastically earlier than cell division.

  1. It assumes that type-1 cells form a population of homogeneous cells. This assumption may be too rigid in practice. For instance, the hematopoietic progenitor cells that give rise to the various blood cell lineages (e.g., myeloid (erythrocytes, megakaryocytes, monocytes, neutrophils, basophils, or eosinophils) or lymphoid (T- and B-lymphocytes)) are known to exhibit varying degrees of commitments to these lineages, thereby presenting dissimilar probabilities of further specializing into any of them. By assuming that the offspring distribution is identical among all type-1 cells, the two-type process would be less realistic.

  2. It may lack the flexibility needed to capture the plasticity exhibited by stem and progenitor cells in order to respond to the varying needs of the body. Feedback mechanisms between the two cell types could be included in the model to describe this plasticity. Such an extension, however, would define a model that is considerably more challenging to study, especially in the age-dependent case.

In contrast, our model restricts assumptions postulated on the unobservable cell population to its influx into the pool of observable cells. The rate of this influx may be time-dependent, as needed.

3. The process and its equations

3.1. The Sevastyanov process

We consider a branching process in which the joint distribution of the lifespan η and offspring ξ of any cell is specified as P{ηB, ξ = k} = ∫B pk(u)dG(u) for every Borel set BR, where G(u) = P(ηu) and k=0pk(u)=1(u0), and every cell evolves independently of all other cells. Put h(u,s)=k=0pk(u)sk, |s| ≤ 1, for the associated probability generating functions (p.g.f.). These assumptions define a (G, h)-Sevastyanov process [32]. Write {Z(t)}t≥0 for the population size at time t.

Define the moments of the offspring and lifespan distributions a(t)=hs(t,s)s=1,b(t)=hss(t,s)s=1,a=0a(t)dG(t),b=0b(t)dG(t),μ=0tdG(t), all assumed finite. This paper is concerned with the subcritical case (a < 1), and we assume the existence of α < 0, the Malthusian parameter, which solves the equation 0e-αxa(x)dG(x)=1. Let G(t) and Ga(α)(t)=0ta(u)e-αudG(u) be non-lattice.

Throughout the paper, we will be assuming that:

0xe-αdG(x)<and0xdGa(α)(x)<, (1)

and

0b(u)e-αudG(u)<and0ub(u)e-αudG(u)<. (2)

Another key assumption will be:

Condition 3.1

The cumulative distribution function (c.d.f.) Gaα(t)=0ta(u)e-αudG(u) is of absolutely continuous type; that is, there exists k ≥ 1 for which the kfold convolution of Ga(α)(.) with itself has an absolutely continuous component (see Definition 2, Ch. VIII.7, [32]).

Put A(t) = E[Z(t)|Z(0) = 1]. When (1) holds true, it is known that ([32], Th. 8.4)

A(t)=Aeαt(1+o(1)),t, (3)

where

A=0e-αt(1-G(t))dt0xe-αxa(x)dG(x).

Define B(t, τ) = E[Z(t)Z(t + τ )|Z(0) = 1], B(t) = E[Z(t)(Z(t) − 1)|Z(0) = 1], and V (t) = Var[Z(t)|Z(0) = 1]. Then V (t) = B(t, 0) − A(t)2 = B(t) + A(t) − A(t)2.

Lemma 3.1

Assume that (1), (2), and Condition 3.1 hold. Then, for every fixed τ ≥ 0, there exists a constant Dτ > 0 such that, as t → ∞,

B(t,τ)=Dτeα(t+τ)(1+o(1)). (4)
Proof

Write B0(t, τ) = B(t, τ )eαt and A0(t) = A(t)eαt. Then, we have that

B0(t,τ)=0tB0(t-u,τ)dGa(α)(u)+I(t,τ),

where

I(t,τ)=eαt0tb(u)A0(t-u)A0(t-u+τ)e-2αudG(u)+tt+τa(u)A0(t-u+τ)e-αudG(u)+e-α(t+τ)(1-G(t+τ))=I1(t,τ)+I2(t,τ)+I3(t,τ),

(see eq. (23) Ch. VIII.8, [32]). Since A0(t) is bounded on [0, ∞), there exists K > 0 such that

I1(t,τ)=eαt0tb(u)A0(t-u)A0(t-u+τ)e-2αudG(u)2Keαt0tb(u)e-2αudG(u).

Applying the line of arguments used in the proof of Theorem 8.10 in [32] gives I1(t, τ ) ∈ L1[0, ∞) and I1(t, τ ) → 0 as t → ∞ for any fixed τ. Similarly, there exists K >0 such that

I2(t,τ)=tt+τa(u)A0(t-u+τ)e-αudG(u)K[1-Ga(α)(t)].

The function K[1-Ga(α)(t)]L1[0,) because of (2), hence so does I2(t, τ ). We deduce from (1) that I3(t, τ) = eα(t+τ)[1−G(t+τ)] ∈ L1[0, ∞). Therefore, I(t, τ ) ∈ L1[0, ∞) and I(t, τ ) → 0 as t → ∞. Applying Theorem 7.9 from [32] completes the proof.

An immediate consequence of Lemma 3.1 is that the variance satisfies

V(t)=D0eαt(1+o(1)),t. (5)

3.2. Sevastyanov process with immigration

Let {Sk}k=1 be a sequence of increasing time points with S0 = 0 that arises from a non-homogeneous Poisson process {Π(t)}t≥0 with instantaneous and cumulative rates r(t) and R(t)=0tr(u)du, with r(t) ≥ 0. Let, for every k = 1, 2 · · ·, Ik be the number of cells immigrating at time Sk, assumed mutually independent. Put g(s) = E[sIk], |s| ≤ 1 for its p.g.f., and γ = E[Ik] = g′(1) and γ2 = g″(1) = E[Ik(Ik −1)] for its mean and second factorial moment. Let Y (t) denote the number of cells in the population at time t described by a branching process with immigration in which the branching mechanism obeys a (G, h)-Sevastyanov process. We decompose Y (t) as

Y(t)={k=1Π(t)i=1IkZ(k,i)(t-Sk)ifΠ(t)>00ifΠ(t)=0, (6)

where {Z(k,i)(t)}t≥0, k, i = 1, 2 · · ·, are independent and identically distributed (i.i.d.) copies of {Z(t)}t≥0.

Define the p.g.f. Ψ (t; s) = E[sY (t)|Y (0) = 0]. Proceeding as in Yakovlev and Yanev ([34], Theorem 1), we obtain that

Ψ(t;s)=exp{-0tr(t-u)[1-g(F(u;s))]du},Ψ(0,s)=1, (7)

where the p.g.f. F(t; s) = E[sZ(t)|Z(0) = 1] satisfies the integral equation

F(t,s)=s(1-G(t))+0th(u,F(t-u,s))dG(u)

with the initial condition F(0, s) = s. Under mild regularity conditions, F(t, s) is the only solution of this equation that belongs to the class of p.g.f.s (see [32]).

We note that {Y (t)}t≥0 is a time-inhomogeneous and non-Markov process. If {Uk=Sk-Sk-1}k=1 are i.i.d. r.v. with c.d.f. G0(x) = P{Ukx} = 1−ex/r0 (x ≥ 0), the immigration process Π(t) reduces to an ordinary Poisson process with instantaneous and cumulative rates r(t) ≡ r0 and R(t) = r0t respectively. Then we obtain the Sevastyanov age-dependent branching process with homogeneous Poisson immigration proposed and investigated by Yanev [35].

Define M(t) = E[Y (t)|Y (0) = 0]. Differentiating both sides of (7), we obtain that

M(t)=Ψs(t;s)s=1=γ0tr(t-u)A(u)du. (8)

Put Ψ(s1,s2;t,τ)=E[s1Y(t)s2Y(t+τ)Y(0)=0], for t, τ ≥ 0. Using a line of arguments similar to that used to prove eq. (7) gives

Ψ(s1,s2;t,τ)=exp{-0tr(u)[1-g(F(s1,s2;t-u,τ))]du-tt+τr(v)[1-g(F(1,s2;t,τ-v))]dv}, (9)

where F(s1,s2;t,τ)=E[s1Z(t)s2Z(t+τ)] is given in eq. (22) Ch. VIII.8, [32].

The proof also uses eq. (6) and the line of arguments used to prove Theorem 1 (Yakovlev and Yanev [34]). Eq. (9) implies that

C(t,τ)=Cov[Y(t),Y(t+τ)]=logΨ(s1,s2;t,τ)s1s2|s1=s2=1=0tr(u)[γB(t-u,τ)+γ2A(t-u)A(t+τ-u)]du, (10)

with initial conditions B(0, τ) = A(τ) and C(0, τ) = 0. Setting τ = 0 in eq. (10) yields

W(t)=Var[Y(t)]=0tr(t-u)[γV(u)+(γ+γ2)A2(u)]du. (11)

4. Asymptotic formulas for the moments

This section is concerned with the expectation, variance, and covariance of Y (t) as t → ∞. We consider 3 cases based on the immigration rate:

  • Case (i). 0r(u)e-αudu< (Proposition 4.1);

  • Case (ii). r(t) = r0eρt where r0 > 0, and ρR (Propositions 4.2 and 4.3). In this case the asymptotics depend [on how the immigration parameter ρ compares to the Maltusian parameter α;

  • Case (iii). r(t) = r0 × tθ or r(t) = r0 × (t + 1)θ where r0 > 0, and θR. In this case the moments either converge to 0 (if θ < 0) or diverge to infinity (if θ > 0). (Proposition 4.4).

We shall use the lemma and corollary below to derive asymptotics for the moments.

Lemma 4.1

Let f(t) ~ Ctθ, as t → ∞, where C > 0 and θ ∈ ℝ. Assume that sup0≤xt f(x) ≤ Dtmax(θ,0) for some D < ∞. Let y(·) be a function such that y(t) ≥ 0 (t ≥ 0), y¯=0y(u)du<, and y(t) = o(tθ−1) if θ < 0. Then, as t → ∞,

I(t)=0tf(t-u)y(u)du~y¯f(t).
Proof

For every 0 < δ < 1, we have I(t)=0tf(t-u)y(u)du=0δt+δtt=I1(t)+I2(t). When the assumptions of the lemma hold, for every ε > 0 and when t is large enough, then (Cε)tθf(t) ≤ (C + ε)tθ and

(C-ε)tθ0δt(1-ut)θy(u)duI1(t)(C+ε)tθ0δt(1-ut)θy(u)du.

To determine the limit of I1(t) as t → ∞, assume first that θ ≥ 0. Then

(C-ε)tθ(1-δ)θ0δty(u)duI1(t)(C+ε)tθ0δty(u)du,(1-εC)(1-δ)θy¯liminftI1(t)f(t)limsuptI1(t)f(t)(1+εC)y¯.

Therefore, limt→∞[I1(t)/f(t)] = ȳ. Assume next that θ ≤ 0. Then

(C-ε)tθ0δty(u)duI1(t)(C+ε)tθ(1-δ)θ0δty(u)du,(1-εC)y¯liminftI1(t)f(t)limsuptI1(t)f(t)(1+εC)(1-δ)θy¯.

Hence limt→∞[I1(t)/f(t)] = ȳ.

Likewise, to study I2(t) as t → ∞, assume first that θ ≥ 0. Then

I2(t)sup0xt(1-δ)f(x)δtty(u)duDtθ(1-δ)θδtty(u)du,

which establishes that lim supt→∞[I2(t)/f(t)] = 0. Assume next that θ < 0. Then, I2(t)sup0xt(1-δ)f(x)δtty(u)du=o(tθ), and lim supt→∞[I2(t)/f(t)] = 0.

We finally deduce that limt→∞[I(t)/f(t)] = ȳ, which completes the proof.

Corollary 4.1

Let f(t) and y(t) be nonnegative functions. Assume that f(t) is bounded in+, and that there exists f* < ∞ and ȳ < ∞ such that limt→∞ f(t) = f* and 0y(t)dt=y¯. Then,

limt0tf(u)y(t-u)du=fy¯.

Define, for every α < 0, r^t(α)=0tr(u)e-αudu, and assume that

limtr^t(α)=r^(α)<. (12)

Inequality (12) holds if, for example, the intensity of the immigration assumes the form r(t) = O(eρt) with ρ < α.

Proposition 4.1

Assume (1), (12), and γ2 < ∞. Then, as t → ∞,

M(t)=Aγr^(α)eαt(1+o(1)). (13)

Moreover, if (2) and Condition 3.1 hold, then, as t → ∞,

C(t,τ)=γr^(α)Dτeα(t+τ)(1+o(1)). (14)
Proof

Eq. (8) entails that

M(t)=γeαt0tr(t-u)e-α(t-u)A(u)e-αudu.

Using eqs. (3) and (12) and applying Corollary 4.1 yields that

0tr(t-u)e-α(t-u)A(u)e-αuduAr^(α),

from which eq. (13) follows. The proof of eq. (14) relies on eqs. (3), (4) and (10), but remains otherwise similar to that of eq. (13).

Therefore, when the assumptions of Proposition 4.1 hold, the variance W(t) satisfies

W(t)=D0γr^(α)eαt(1+o(1)),t.

Proposition 4.2

Assume (1), r(t) = r0eρt for some constant r0 > 0, and t → ∞.

  1. If ρ > α, then M(t) = γr0Â(ρ)eρt(1 + o(1)), A^(ρ)=0e-ρuA(u)du<;

  2. If ρ = α, then M(t) = γr0Ateαt(1 + o(1));

  3. If ρ < α, then M(t)=r0γAα-ρeαt(1+o(1)).

Proof
  1. We have from eq. (8) that M(t)=γr0eρt0te-(ρ-α)uA(u)e-αudu. Since A(u)eαuA, u → ∞ (by eq. (3)), and ρα > 0 the integral converges to  (ρ) which completes the proof.

  2. In this case M(t)=γr0eat0tA(u)e-αudu and 0tA(u)e-αudu~At, t → ∞, which completes the proof.

  3. We have that M(t)=γr0eαt0te(ρ-α)(t-u)A(u)e-αudu. Since A(u)eαuA, u → ∞, (by eq. (3)) and 0e(ρ-α)tdt=1/(α-ρ)>0, the proof follows from Corollary 4.1.

Proposition 4.3

Assume (1), (2), Condition 3.1, r(t) = r0eρt, r0 > 0, and t → ∞.

  1. If ρ > α then C(t, τ) = C(τ )r0eρt+ατ (1 + o(1)), where
    C(τ)=0e-ρu-ατ[γB(u,τ)+γ2A(u)A(u+τ)]du<.
  2. If ρ = α then C(t, τ) = r0γDτ teα(t+τ)(1 + o(1)).

  3. If ρ < α then C(t,τ)=r0γDτα-ρeα(t+τ)(1+o(1)).

Proof

We deduce from eq. (10) that

C(t,τ)=r0eρt+ατ0te-(ρ-α)u[γB(u,τ)+γ2A(u)A(u+τ)]e-α(u+τ)du.

In case (i), eqs. (3), (4), and (5) entail that

[γB(u,τ)+γ2A(u)A(u+τ)]e-α(u+τ)γDτ,t. (15)

Since ρ > α, the integral

C(τ)=0e-(ρ-α)u[γB(u,τ)+γ2A(u)A(u+τ)]e-α(u+τ)du

converges. This completes the proof of (i).

In case (ii), it follows from eq. (15) that

0t[γB(u,τ)+γ2A(u)A(u+τ)]e-αudu~γDτt,t,

which completes the proof of (ii).

In case (iii), we have that

C=0e-(α-ρ)udu=1α-ρ(0,)

and the statement follows from eq. (15) and Corollary 4.1.

Corollary 4.2

Suppose the assumptions of Proposition 4.3 hold. Then, as t → ∞:

  1. If ρ > α, then W(t) = Weρt(1 + o(1)) where
    W=r00e-ρu[γV(u)+(γ+γ2)A2(u)]du<;
  2. If ρ = α, then W(t) = r0γD0teαt(1 + o(1));

  3. If ρ < α, then W(t)=r0γD0α-ρeαt(1+o(1)).

Proposition 4.4

Suppose that (1), (2), and Condition 3.1 hold, and assume further that r(t) = r0 × tθ, 0 < θ <, or r(t) = r0 × (t + 1)θ, −∞ < θ < 0, where r0 > 0 is a constant. Then, as t → ∞,

M(t)=Mtθ(1+o(1)),M=γr00A(u)du, (16)
W(t)=Wtθ(1+o(1)),W=r00[γV(u)+(γ+γ2)A2(u)]du (17)

and for any τ ≥ 0,

C(t,τ)=C(τ)tθ(1+o(1)), (18)

where C(τ)=r00(γB(u,τ)+γ2A(u)A(u+τ))du.

Proof

Eq. (3) implies that 0A(u)du<. Then eq. (16) follows from eq. (8) and Lemma 4.1. Eq. (17) is a consequence of eqs. (11), (3) and (5), and Lemma 4.1. The proof of (18) proceeds similarly using eqs. (10), (3) and (4).

5. Limit theorems

This section presents four classes of limit theorems. The first one is a conditional limit theorem of the form limt→∞ P{Y (t) = k|Y (0) > 0} = qk, with k=1qk=1, based on the fact that Y(t)P0 as t → ∞ when limt→∞M(t) = 0. This result is akin to a limit theorem for subcritical processes without immigration (Theorem 2, sect. IX.3, [32]). The second one is a LLN that shows that Y (t)/M(t) converges to 1 in some appropriate sense as M(t) → ∞. The third one is a Central Limit Theorem satisfied by Y (t) when properly normalized. The fourth class of theorems generalizes a classical result on the asymptotic distribution of Y (t) for Markov branching processes with immigration when limt→∞ r(t) = r0 > 0 that is due to Sevastyanov [29].

One of the by-products of these limit theorems is the classification of the process into three subclasses:

  1. the subcritical-subcritical case for which conditional limiting distributions are obtained (see Theorems 5.1, 5.2, 5.3);

  2. the subcritical-supercritical case for which LLN and CLT are established (see Theorems 5.4, 5.5, 5.6, and 5.7);

  3. the pure subcritical case for which a stationary distribution exists and is characterized in Theorem 5.8.

It is interesting to point out that in case (i) the probability of non-extinction converges exponentially quickly to zero at rate α, the Malthusian parameter (see Theorem 5.1). In Theorem 5.2, the convergence rate is ρ, the immigration rate, and in Theorem 5.3 it is regular varying at infinity with exponent θ < 0 (the parameter of the immigration intensity).

In case (ii), we show that the asymptotic variance of the normalized process (σ2) depends on the parameter ρ of the immigration intensity in Theorem 5.5, whereas in Theorem 5.7 it is independent of the corresponding parameter θ. In both cases we show that 0 < σ2 < 1.

Theorem 5.1

Assume (1), (2), and limt→∞ t(α) = (α) <. Then,

  1. P{Y (t) > 0} = Ceαt(1 + o(1)), C > 0, as t → ∞.

  2. There exists a conditional stationary distribution
    limtP{Y(t)=kY(t)>0}=qk>0,k=1,2....

Proof

Under the assumptions of the theorem, we have ([32], sect. IX.3 Theorem 1 and 2) as t → ∞ and for every s ∈ [0, 1]

P{Z(t)>0}=1-F(t,0)=Qeαt(1+o(1)), (19)
1-F(t,s)=Q(s)eαt(1+o(1)). (20)

Since 1 − g(s) = γ(1 − s)(1 + o(1)), it follows, as t → ∞, that

1-g(F(t,0))=γQeαt(1+o(1)), (21)

and for every s ∈ [0, 1],

1-g(F(t,s))=γQ(s)eαt(1+o(1)). (22)

Define the conditional p.g.f.

Ψ(t;s)=E{sY(t)Y(t)>0}=1-1-Ψ(t;s)1-Ψ(t;0). (23)

Note first that Ψ(t; 0) = eJ(t), where J(t)=0tr(t-u)[1-g(F(u;0))]du. Then, eq. (21) and Lemma 4.1 entail, as t → ∞, that

J(t)=eαt0tr(t-u)e-α(t-u)e-αu(1-g(F(u,0))du~eαtγQr^(α).

Furthermore, Ψ(t; s) = exp(−J(t; s)), where from (22) and Lemma 4.1:

J(t;s)=0tr(t-u)(1-g(F(u;s)))du=eαt0tr(t-u)e-α(t-u)e-αu(1-g(F(u;s)))du~eαtγQ(s)r^(α),t.

Since α < 0, J(t) → 0 and J(t; s) → 0, uniformly in s ∈ [0, 1]. Therefore, as t → ∞

1-Ψ(t;s)=1-e-J(t;s)=J(t;s)(1+o(1))=eαtγQ(s)r^(α)(1+o(1)),1-Ψ(t;0)=1-e-J(t)=J(t)(1+o(1))=eαtγQr^(α)(1+o(1)),

The last two relationships show that uniformly in s ∈ [0, 1]

limtΨ(t;s)=Ψ(s)=k=1qksk=1-Q(s)/Q,

which completes the proof of the theorem by invoking the continuity theorem for p.g.f.

Remark 5.1

The limiting p.g.f. Ψ(s)=k=1qksk, 0 ≤ s≤ 1, in Theorem 5.1 is similar to that holding for the standard Sevastyanov process without immigration.

Theorem 5.2

Assume (1), (2), and r(t) = r0eρt, r0 > 0, α < ρ < 0. Then,

  1. P{Y (t) > 0} = Keρt(1 + o(1)), K > 0, as t → ∞.

  2. There exists a conditional stationary distribution
    limtP{Y(t)=kY(t)>0}=qk>0,k=1,2,,
    where
    Ψ(s)=1-0e-ρu[1-g(F(u;s))]du0e-ρu[1-g(F(u;0))]du,Ψ(1)=1.

Proof

Following the proof of the previous theorem we obtain

J(t)=r0eρt0te-ρu[1-g(F(u;0))]du~r0Keρt,t,

where K=0e-ρu[1-g(F(u;0))]du<. Similarly for every s ∈ [0, 1)

J(t;s)=r0eρt0te-ρu[1-g(F(u;s))]du~r0K(s)eρt,t,

where K(s)=0e-ρu[1-g(F(u;s))]du<. Therefore, following the proof of Theorem 5.1, we obtain as t → ∞ that

P{Y(t)>0}=1-Ψ(t;0)~r0Keρt,1-Ψ(t;s)~r0K(s)eρt.

Hence, by (23), there exists Ψ*(s) = limt→∞ Ψ*(t; s) = 1 − K(s)/K, which proves the theorem.

Theorem 5.3

Assume (1), (2) and r(t) = r0 × (t + 1)θ, θ < 0, r0 > 0. Then

  1. P{Y (t) > 0} ~ −(r0γQ/α)tθ as t → ∞.

  2. There exists a conditional stationary distribution {qk}k=1 such that
    limtP{Y(t)=kY(t)>0}=qk(k=1,2,)

    where Ψ*(s) = 1 − Q(s)/Q, Ψ*(1) = 1, and Q and Q(s) are defined in (19) and (20).

Proof

Consider the conditional p.g.f. Ψ*(t; s) as defined in eq. (23) and note that Ψ(t; s) = exp{−r0 × (t + 1)θJ1(t; s)} where

J1(t;s)=0t(1-u/(t+1))θ[1-g(F(u;s))]du=(t+1)01-1/(t+1)(1-x)θ[1-g(F(x(t+1);s))]dx.

Setting s = 0, we deduce from (21) that

1-g(F(x(t+1);0))~γ[1-F(x(t+1);0)~γQeαx(t+1),t.

Therefore,

J1(t;0)~γQ×(t+1)01-1/(t+1)(1-x)θeαx(t+1)dx,t.

Furthermore, as t → ∞,

(t+1)01-1/(t+1)(1-x)θeαx(t+1)dx=α-1[eαt(t+1)-θ-1+θ01-1/(t+1)(1-x)θ-1eαx(t+1)dx]-α-1,

because Lemma 4.1 ensures that

I(t)=01-1/(t+1)(1-x)θ-1eαx(t+1)dx=(t+1)-θ0t(t+1-u)θ-1eαudu~-(αt)-1.

Hence limt→∞ J1(t; 0) = γQ/(−α) such that

1-Ψ(t;0)~1-exp{(r0γQ/α)tθ}~-(r0γQ/α)tθ,t,

which completes the proof of (i).

Similarly, eq. (22) implies, as t → ∞, that

1-g(F(xt;s))~γ[1-F(xt;s)]~γQ(s)eαxt.

Hence,

J1(t;s)~γQ(s)(t+1)01-1/(t+1)(1-x)θeαx(t+1)dx,t.

Therefore limt→∞ J1(t; s) = γQ(s)/(−α), and 1−Ψ(t; s) ~ 1−exp{(r0γQ(s))tθ} ~ −(r0γQ(s))tθ. Hence, limt→∞ Ψ*(t; s) = Ψ*(s) = 1 − Q(s)/Q.

Corollary 5.1. [Markov case]

Assume that G(x) = 1 − ex/μ (x ≥ 0) for some μ > 0, h(·; s) ≡ h(s) for every |s| ≤ 1, and

0<-logQ=01{[αx+f(1-x)]/xf(1-x)}dx<,

where f(s) = [h(s) − s]/μ is the infinitesimal g.f. Then

Ψ(s)=1-exp{α0sdx/f(x)}withΨ(1)=1.

Proof

The following asymptotic identities hold as t → ∞ under the assumptions of the theorem (see [32], Ch.II.2, Th.1 and Ch.II.4, Th.1)

1-F(t,0)~Qeαt,Q>0,[1-F(t,s)]/[1-F(t,0)]exp{α0s(1/f(x))dx}.

Therefore, we deduce from the proof of Theorem 5.3 that Q(s)=Qexp{α0sdx/f(x)}. Hence,

Ψ(s)=1-Q(s)/Q=1-exp{α0s(1/f(x))dx}.

Theorem 5.4

Assume that inequalities (1) and (2), and Condition 3.1 hold. Assume further that r(t) = r0eρt, r0 > 0, ρ>0, γ2 <. Then, as t → ∞

ζ(t)=Y(t)/M(t)1,a.s.andinL2.

Proof

To establish the convergence in L2, it it is sufficient to show that as t → ∞,

Δ(t,τ)=E{ζ(t+τ)-ζ(t)}20,

uniformly for τ ≥ 0. Note that E{ζ(t)} 1, and

Δ(t,τ)=Var(ζ(t+τ))+Var(ζ(t))-2Cov{ζ(t),ζ(t+τ)},Var(ζ(t))=W(t)M(t)-2Cov{ζ(t),ζ(t+τ)}=C(t,τ)/(M(t)M(t+τ)).

Since ρ > α we deduce from Proposition 4.2 (i), Corollary 4.2 (i), and Proposition 4.3 (i) as t → ∞, that

W(t)M(t)-2=Weρt(γr0A^(ρ))-2e-2ρt0,W(t+τ)M(t+τ)-2=Weρ(t+τ)(γr0A^(ρ))-2e-2ρ(t+τ)0,C(t,τ)(M(t)M(t+τ))-1=C(τ)r0eατ+ρt(γr0A^(ρ))-2e-ρ(2t+τ)0,

where the convergence in the last two relationships are uniform in τ ≥ 0. Therefore limt→∞ Δ(t, τ ) = 0 uniformly in τ ≥ 0, which proves the convergence in L2 and

Δ(t)=limτΔ(t,τ)=E{ζ(t)-1}2=W(t)/M2(t)~K1e-ρt,

where K1 = W/(γr0 Â(ρ))2. Therefore 0Δ(t)dt< and by Theorem 21.1 of Harris [6], we deduce that ζ(t) converges a.s. to 1.

Theorem 5.5

Assume (1), (2), Condition 3.1, r(t) = r0eρt, r0 > 0, ρ > 0 and γ2 <. Then

X(t)=[Y(t)-M(t)]/W(t)DN(0,σ2),t,

where

σ2=0e-ρu(γB(u)+γ2A2(u))du0e-ρu(γB(u)+γA(u)+γ2A2(u))du(0,1). (24)

Proof

Let φt(z) = E{eizX(t)} denote the characteristic function of X(t). Then,

φt(z)=e-izM(t)/W(t)E{eizY(t)/W(t)}=e-izM(t)/W(t)Ψ(t;eiz/W(t)).

We deduce from eq. (7) that

logφt(z)=-izM(t)/W(t)-0tr(t-u)[1-g(F(u;eiz/W(t)))]du.

The following asymptotic expansions hold as s → 1 (see [32])

1-g(s)~γ(1-s)-γ2(1-s)2/2,1-F(u;s)~A(u)(1-s)-B(u)(1-s)2/2.

Moreover 1 − ex = −x(1 + o(1)) as x → 0. Hence, as t → ∞,

logφt(z)~-izM(t)W(t)-0tr(t-u){γ[1-F(u;eizW(t))]-γ22[1-F(u;eizW(t)]2}du, (25)

and

1-F(u;eizW(t))~A(u)(1-eizW(t))-B(u)2(1-eizW(t))2~-izA(u)W(t)+z2B(u)2W(t).

Therefore,

0tr(t-u){γ[1-F(u;eizW(t))]-γ22[1-F(u;eizW(t))]2}du~-izγW(t)0tr(t-u)A(u)du+z2γ2W(t)0tr(t-u)B(u)du+γ2z22W(t)0tr(t-u)A2(u)du~-izM(t)W(t)+z22[1-M(t)W(t)].

Returning to eq. (25), and letting t → ∞, we find that

logφt(z)~-z22[1-M(t)W(t)]. (26)

We deduce from Proposition 4.2 (i) and Corollary 4.2 (i) that

limtM(t)W(t)=0e-ρuγA(u)du0e-ρu(γB(u)+γA(u)+γ2A2(u))du.

from which the expression for σ2 given in eq. (24) follows. Finally, limt→∞ φt(z) = ez2σ2/2, which is the characteristic function of a normal distribution with mean 0 and variance σ2, and the assertion follows from the continuity theorem [4].

Corollary 5.2

Theorem 5.5, Proposition 4.2 (i) and Corollary 4.2 (i) entail the asymptotic normality:

Y(t)e-ρt~N(r0γA^(ρ),σ2We-ρt),t.

Theorem 5.6

Assume (1), (2), γ2 <, Condition 3.1, and r(t) = r0tθ with θ > 0 and r0 > 0. Then ζ(t) = Y (t)/M(t) → 1 in L2 as t → ∞. The convergence is almost sure if θ > 1.

Proof

We first deduce from (16), (17), and (18) that, as t → ∞,

Var(ζ(t))=W(t)M-2(t)~WM-2t-θ, (27)

and

Cov{ζ(t),ζ(t+τ)}=C(t,τ)(M(t)M(t+τ))-1~C(τ)M-2(t+t)-θ. (28)

Then eq. (27) and (28) entail that Δ(t, τ ) → 0 uniformly in τ ≥ 0, and the convergence in L2 follows.

Assume now that θ > 1. Eqs. (27) and (28) entails that Var(ζ(t+τ )) ~ WM−2(t+ τ )θ → 0 and Cov{ζ(t), ζ(t + τ )} ~ C(τ )M−2(t + τ )θ → 0, τ → ∞. Hence, Δ(t) ~ WM−2tθ, t → ∞, and 0Δ(t)dt<. We deduce from Theorem 21.1 of Harris [6] that ζ(t) converges to 1 a.s..

Theorem 5.7

Assume (1), (2), γ2 <, Condition 3.1, and r(t) = r0tθ with θ > 0 and r0 > 0. Then X(t)=[Y(t)-M(t)]/W(t)DN(0,σ2) as t → ∞, where

σ2=0[γB(u)+γ2A2(u)]du0[γB(u)+γ2A2(u)+γA(u)]du(0,1).

Proof

Following the line of arguments used in the proof of Theorem 5.5 gives

logφt(z)~-z22[1-M(t)W(t)],t. (29)

We deduce from eqs. (16) and (17) in Proposition 4.4 that limtM(t)/W(t)=M/W. Finally, we obtain from eq. (29) that limtφt(z)=e-z2σ2/2, which is the characteristic function of the normal distribution with mean 0 and variance σ2. The assertion follows from the continuity theorem (e.g., Feller [4]).

Corollary 5.3

Theorem 5.7 and Proposition 4.4 entail the asymptotic normality: Y (t)tθ ~ N(M,σ2Wtθ), t → ∞.

Theorem 5.8

Assume (1), γ <and that limt→∞ r(t) = r0 > 0. Then there exists a limiting distribution Qk = limt→∞ P{Y (t) = k} > 0 (k = 0, 1, 2 · · · ), such that

Ψ(s)=k=0Qksk=exp{-r00[1-g(F(u,s))]du},s1.

Proof

Under the assumptions of the theorem, |1−g(s)| ≤ γ|1−s| and |1−F(u; s)| ≤ A(u)|1 − s|. Therefore

0tr(t-u)[1-g(F(u,s))]duγ1-s0tr(t-u)A(u)du.

Corollary 4.1 implies that

limt0tr(t-u)A(u)du=r00A(u)du<.

Hence,

limtΨ(t;s)=Ψ(s)=exp{-r00[1-g(F(u,s))]du}

uniformly in |s| ≤ 1.

Pakes [26] obtained a similar limiting distribution for the Bellman-Harris process.

Corollary 5.4

If G(x) = 1−ex/μ (x ≥ 0), for some μ > 0, and h(u; s) ≡ h(s) then

Ψ(s)=exp{-r0s1[1-g(x)]/f(x)dx}.

Proof

It follows from the assumptions that {Z(t)}t≥0 is a Markov branching process, and it is characterized by the Kolmogorov differential equations

tF(t;s)=f(F(t;s)),tF(t;s)=f(s)sF(t;s),F(0;s)=s,

where f(s) = (h(s) − s) (e.g., Harris [6]). Therefore,

s0[1-g(F(u,s))]du=-0g(F(u;s))F(u;s)sdu=-1f(s)0g(F(u;s))F(u;s)udu=-1-g(s)f(s),

using the fact that F(∞; s) = 1 and F(0; s) = s. Hence

0[1-g(F(u,s))]du=s1[1-g(x)]/f(x)dx,

which completes the proof.

Sevastyanov [29] obtained the same p.d.f. when r(·) ≡ r0 > 0.

Acknowledgments

The authors are thankful to the anonymous referee for his valuable suggestions which improve the earlier version of the paper.

The research was partially supported by the NFSR of the Min. Edu. Sci. of Bulgaria, grant No. DFNI-I02/17 and by NIH R01 Grants NS039511, CA134839, and AI069351.

Contributor Information

OLLIVIER HYRIEN, University of Rochester.

KOSTO V. MITOV, Aviation faculty-NMU.

NIKOLAY M. YANEV, Bulgarian Academy of Sciences.

References

  • 1.Ahsanullah M, Yanev GP. Records and Branching Processes. Nova Science publishers; New York: 2008. [Google Scholar]
  • 2.Assmusen S, Hering H. Branching Processes. Birkhauser; Boston: 1983. [Google Scholar]
  • 3.Athreya KB, Ney PE. Branching Processes. Springer; New York: 1972. [Google Scholar]
  • 4.Feller W. An Introduction to Probability Theory and Its Applications. Vol. 2. Wiley; New York: 1971. [Google Scholar]
  • 5.Chen R, Hyrien O, Mayer-Proschel M, Noble M. A composite likelihood approach to the analysis of longitudinal clonal data under an age-dependent branching process. Biostatistics. 2010;12:173–191. doi: 10.1093/biostatistics/kxq050. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 6.Harris TE. The Theory of Branching Processes. Springer; Berlin: 1963. [Google Scholar]
  • 7.Hyrien O, Mayer-Proschel M, Noble M, Yakovlev A. A stochastic model to analyze clonal data on multi type cell populations. Biometrics. 2005;61:199–207. doi: 10.1111/j.0006-341X.2005.031210.x. [DOI] [PubMed] [Google Scholar]
  • 8.Hyrien O, Ambeskovic I, Mayer-Proschel M, Noble M, Yakovlev A. Stochastic modeling of oligodendrocyte generation in cell culture: model validation with time-lapse data. Theoretical Biology and Medical Modelling. 2006;3:21. doi: 10.1186/1742-4682-3-21. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 9.Hyrien O, Chen R, Mayer-Proschel M, Noble M. Saddlepoint approximations to the moments of age-dependent branching processes with applications. Biometrics. 2010;66:567–577. doi: 10.1111/j.1541-0420.2009.01281.x. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 10.Hyrien O, Dietrich J, Noble M. Quantitative analysis of the effect of chemotherapy on division and differentiation of glial precursor cells. Cancer Research. 2010;70(24):10051–10059. doi: 10.1158/0008-5472.CAN-10-1400. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 11.Hyrien O, Yanev NM. Modeling cell kinetics using branching processes with non-homogeneous Poisson immigration. Compt Rendus l’Acad Bulgar Sci. 2010;63:1405–1414. [PMC free article] [PubMed] [Google Scholar]
  • 12.Hyrien O, Yanev NM, Jordan CT. A test of homogeneity for age-dependent branching processes with immigration. Electronic Journal of Statistics. 2014;9:898–925. doi: 10.1214/15-EJS1024. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 13.Hyrien O, Peslak S, Yanev NM, Palis J. A stochastic model of stress erythropoiesis using a two-type age-dependent branching process with immigration. J Math Biol. 2015;70:1485–1521. doi: 10.1007/s00285-014-0803-x. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 14.Hyrien O, Yanev NM. Age-dependent branching processes with non-homogeneous Poisson immigration as models of cell kinetics. In: Oakes D, Hall WJ, Almudevar A, editors. Modeling and Inference in Biomedical Sciences: In Memory of Andrei Yakovlev. Institute of Mathematical Statistics; Beachwood, Ohio: 2015. IMS Collections Series. (in press) [Google Scholar]
  • 15.Hyrien O, Mitov KM, Yanev NM. CLT for Sevastyanov branching processes with non-homogeneous immigration. J Appl Stat Sci. 2015;21:229–237. [Google Scholar]
  • 16.Hyrien O, Mitov KM, Yanev NM. Supercritical Sevastyanov branching processes with non-homogeneous Poisson immigration. In: del Puerto IM, Gonzales M, Gutierrez C, Martinez R, Minuesa C, Molina M, Mota M, Ramos A, editors. Branching Processes and their Applications. Vol. 219. Springer; New York: 2016. pp. 151–166. Lecture Notes in Statistics. [Google Scholar]
  • 17.Jagers P. Age-dependent branching processes allowing immigration. Theory Probab Appl. 1968;13:225–236. [Google Scholar]
  • 18.Jagers P. Branching Processes with Biological Applications. Wiley; London: 1975. [Google Scholar]
  • 19.Kaplan N, Pakes AG. Supercritical age-dependent branching processes with immigration. Stochastic Process Appl. 1974;2:371–389. [Google Scholar]
  • 20.Kesten H, Stigum BP. Limit theorems for decomposable multi-dimensional Galton-Watson processes. J Math Anal Appl. 1967;17:309–338. [Google Scholar]
  • 21.Mitov KV, Yanev NM. Bellman-Harris branching processes with state-dependent immigration. J Appl Probab. 1982;22:757–765. doi: 10.1017/jpr.2017.18. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 22.Mitov KV, Yanev NM. Bellman-Harris branching processes with a special type of state-dependent immigration. Adv Appl Probab. 1989;21:270–283. [Google Scholar]
  • 23.Mitov KV, Yanev NM. Critical Bellman-Harris branching processes with infinite variance allowing state-dependent immigration. Stoch Models. 2002;18:281–300. [Google Scholar]
  • 24.Mitov KV, Yanev NM. Sevastyanov branching processes with non-homogeneous Poisson immigration. Proc Steklov Inst Math. 2013;282:172–185. [Google Scholar]
  • 25.Olofsson P. General branching processes with immigration. Journal of Applied Probability. 1996;33:940–948. [Google Scholar]
  • 26.Pakes AG. Limit theorems for an age-dependent branching process with immigration. Math Biosci. 1972;14:221–234. [Google Scholar]
  • 27.Pakes AG, Kaplan N. On the subcritical Bellman-Harris process with immigration. J Appl Probab. 1974;11:652–668. [Google Scholar]
  • 28.Radcliffe J. The convergence of a super-critical age-dependent branching processes allowing immigration at the epochs of a renewal process. Math Biosci. 1972;14:37–44. [Google Scholar]
  • 29.Sevastyanov BA. Limit theorems for branching random processes of special type. Theory Probab Appl. 1957;2:339–348. (in Russian) [Google Scholar]
  • 30.Sevastyanov BA. Age-dependent branching processes. Theory Probab Appl. 1964;9:577–594. (Letter (1966). 11, 363–364.) (in Russian) [Google Scholar]
  • 31.Sevastyanov BA. Limit theorems for age-dependent branching processes. Theory Probab Appl. 1968;13:243–265. (in Russian) [Google Scholar]
  • 32.Sevastyanov BA. Branching Processes. Nauka, Moscow: 1971. (in Russian) [Google Scholar]
  • 33.Yakovlev A, Yanev NM. Branching stochastic processes with immigration in analysis of renewing cell populations. Math Biosci. 2006;203:37–63. doi: 10.1016/j.mbs.2006.06.001. [DOI] [PubMed] [Google Scholar]
  • 34.Yakovlev A, Yanev NM. Age and residual lifetime distributions for branching processes. Statist Probab Lett. 2007;77:503–513. [Google Scholar]
  • 35.Yanev NM. Branching processes allowing immigration. Bul Inst Math Acad Bulg Sci. 1971;15:71–88. (in Bulgarian) [Google Scholar]
  • 36.Yanev NM. On a class of decomposable age-dependent branching processes. Math Balkanica. 1972;2:58–75. (In Russian) [Google Scholar]

RESOURCES