Preprint
Article

This version is not peer-reviewed.

Critical Markov Branching-Immigration Systems: Complete Classification of the State Space and Exact Rates of Convergence

A peer-reviewed version of this preprint was published in:
Mathematics 2026, 14(20), 3698. https://doi.org/10.3390/math14203698

Submitted:

20 September 2026

Posted:

21 September 2026

You are already at the latest version

Abstract
We study a critical homogeneous continuous-time Markov branching-immigration system whose offspring and immigration generating functions are regularly varying at the point~1 of orders \(1+\nu\) and \(\delta\) with \(\nu,\delta\in(0,1]\), the slowly varying factors being controlled through their index functions. Two numbers govern the classification: the difference \(\gamma=\delta-\nu\) of the two orders and the limit \(\Lambda_{\infty}\) of the ratio of the immigration factor to the offspring one. We classify the state space completely: positive recurrent for \(\gamma>0\), transient for \(\gamma< 0\), and on the boundary \(\gamma=0\) null recurrent or transient according as \(\Lambda_{\infty}\le{\nu}\) or \(\Lambda_{\infty}>\nu\), which at \(\nu=\delta=1\) reduces to the classical threshold. In each regime we identify the limiting generating function of the normalised transition functions together with the exact rate of convergence to it, uniformly in the argument on compact subsets of [0,1), the transient rate under two further inequalities on the parameters; and we carry every rate to the individual transition probabilities, with no monotonicity hypothesis, by a complex-analytic argument resting on a factorisation that criticality forces. The constants are made accessible by an exact integral identity for the survival probability of the system without immigration, which also yields a three-term expansion of that probability in closed form. A numerical section on explicit models confirms the constants and the rates.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

Branching systems are among the oldest and most persistent models of population growth, and the continuous-time Markov branching system is the member of the family in which the interplay between reproduction and time is the most transparent: an individual alive at time t waits an exponential time and is then replaced by a random number of offspring, independently of everything else. Throughout the paper t is time and runs over the axis T : = [ 0 , ∞ ) , while s is the argument of a generating function and runs over [ 0 , 1 ) ; both are fixed formally in Section 2, and s is allowed to be complex only in Section 9 and in the numerical check of its bounds in Section 10. Adding an immigration stream, so that new individuals enter the population at the epochs of an independent Poisson-type mechanism, turns the model into a genuinely different object. The population can no longer become extinct in the absolute sense, and the question of long-time behaviour becomes a question about the recurrence structure of an irreducible Markov chain on the nonnegative integers. Classical accounts are given in [3,14,36], and the immigration model itself goes back to Sevastyanov [35], Yang [40] and Pakes [30]; in discrete time see Foster and Williamson [10] and Zubkov [42], and, for the process stopped at the origin, Ivanoff and Seneta [21].
The critical case, in which the mean offspring number per individual is exactly one, is at the same time the most delicate and the most informative. Under a second moment condition on the offspring law and a first moment condition on the immigration law, Sevastyanov [35] and Pakes [30] showed that the transition functions decay polynomially and that a limiting generating function exists after multiplication by t λ , where λ is the ratio of the immigration mean to half the offspring variance. The power series expansion of that limit generates an invariant measure; for the system without immigration the corresponding structure is the theorem of Kesten, Ney and Spitzer [23]. Li, Chen and Pakes [25] refined the picture considerably, and Imomov [15] added rates of convergence under finiteness of the third derivative of the offspring generating function and of the second derivative of the immigration one.
Once the second moment of the offspring law is infinite the classical normalisation collapses, because the constant λ that drives it is no longer defined. The natural replacement is a regular variation hypothesis: the offspring generating function f ( s ) and the immigration generating function h ( s ) are taken regularly varying at the point 1, of orders 1 + ν and δ with ν , δ ∈ ( 0 , 1 ] and with slowly varying factors L ( * ) and ℓ ( * ) . These are the hypotheses [ f ν ] , [ h δ ] of Section 2, where both functions are written out in full; the classical case is ν = δ = 1 . Besides the two orders, one number built from the slowly varying factors will matter throughout, the limit Λ ∞ : = lim x → ∞ ℓ ( x ) / L ( x ) , introduced formally at (13). In discrete time, limit theorems for the critical process with immigration and infinite offspring variance go back to Pakes [31], and regularly varying immigration has been taken up more recently in [4,5]. This exact setting was worked out in [18,25], where it was shown that the sign of the single parameter γ = δ − ν separates a recurrent from a transient regime, and four of the present authors [17] developed the transient side of that dichotomy in detail; rates of convergence in the two regimes γ ≠ 0 were taken up in [16]. That line of work leaves open the boundary between the two regimes, the normalisation of the transient one and the control of the slowly varying factors, and the present paper answers all three.
Nothing is said there about the boundary γ = 0 , which is precisely the stratum containing the classical case ν = δ = 1 ; and the classical case is known to split further, into a recurrent and a transient part, according to the size of λ . One expects a dichotomy on the whole of the boundary, and we prove that there is one: for γ = 0 the state space is null recurrent when Λ ∞ ≤ ν and transient when Λ ∞ > ν , with Λ ∞ as above. At ν = δ = 1 this reduces exactly to the classical threshold. Together with the two open regimes this gives a complete classification of the state space, stated as Theorem 6 below.
In the transient regime it is the normalisation that has to be corrected. When γ < 0 the transition functions decay at a stretched exponential rate, and the correct normalising factor is exp { Θ ( t ) } with
Θ ( t ) = ( Λ ∞ / | γ | ) [ τ ( t ) ] | γ | ,
where τ ( t ) = 1 / q ( t ) is the reciprocal of the survival probability q ( t ) of the branching system without immigration. With the simpler factor [ τ ( t ) ] | γ | used there, the limit exists only under the additional hypothesis Λ ∞ = | γ | , which cuts a null set out of the parameter space. Carrying the constant Λ ∞ through the normalisation costs nothing and removes the hypothesis altogether; this is Theorem 7.
The slowly varying factors themselves call for a control of a different kind. The standard device is to postulate a remainder in the shift relation L ( μ t ) / L ( t ) = 1 + w μ ( t ) and then to suppress the dependence of w μ on the shift μ . The suppression has a cost. All of the estimates in this circle of problems are driven not by w μ but by the index function ε L ( x ) = x L ′ ( x ) / L ( x ) of the representation theorem, and the two are proportional with a factor that depends on μ and is not identically equal to one. We therefore state the hypotheses directly in terms of the index function, and record the relation to the shift remainder as a lemma. The gain is not only cleanliness. The identity that the index function satisfies is exact, and the exact identity, given as Lemma 3 below, produces a three-term asymptotic expansion of the survival probability,
1 q ν ( t ) = ν L ∞ t − c L ν ln ( ν L ∞ t ) + c + o ( 1 ) as t → ∞ ,
in which L ∞ is the limit of the slowly varying factor L ( x ) of the offspring generating function, c L is the limit of x ν times its index function, and c is a constant built from the same data; all three are written out in terms of f ( s ) alone in Theorem 2. When L ( * ) is constant the exact identity behind this expansion degenerates to 1 / V ( q ( t ) ) = ν t + 1 / a 0 , where V ( y ) : = y ν L ( 1 / y ) is the auxiliary function introduced at (12) below, which is both elementary and classical; it is for a genuinely varying L ( * ) , including a non-constant one with ν = 1 , that the expansion has content. A two-term form of it, with a logarithmic correction of the same shape but retaining an implicitly defined norming function, is [17, Thm. 1]; the coefficient carried there is the present one at c L = L ∞ , which is a hypersurface of the parameter space and not an identity, and Remark 2 says where the difference comes from. What is added here is the third term, the constant c , and the removal of the norming function, which is what makes the expansion usable as it stands.
Beside this line of work should be placed the recent paper of Mitov and Yanev [28], which carries the same two regular variation hypotheses into a wider model: immigration there occurs at the jump epochs of a Poisson process of intensity r ( t ) with r ( t ) tending to a positive constant, so that the present system is the case of an intensity constant throughout, their offspring order being our ν and their immigration order our δ . Their companion papers [27,29] treat the same model with an increasing intensity and with one tending to zero, and the present system is a case of neither. The results of [28] touch ours at four places, and only two of them concern a statement proved below, in each case on a stratum that was already known. Their criterion separates δ > ν from δ ≤ ν by the convergence of an integral, which is the positive recurrent stratum of Theorem 6(i); the splitting of the boundary δ = ν into a null recurrent and a transient part is not addressed there, and it is that splitting which Theorem 6(ii) supplies. On that same boundary they obtain a proper limit law for the population size divided by τ ( t ) , of Laplace transform ( 1 + u ν ) − Λ ∞ / ν for u > 0 , and their divergent case covers the transient stratum δ < ν as well, yielding there a stable limit law for the population size under its own normalisation. These two limit laws are statements in which the argument of the generating function approaches 1 as t grows, and they are complementary to Theorems 10 and 7 below, which keep the argument fixed and describe the invariant measure. Their convergent case yields for δ > ν the limiting generating function of Theorem 11 below, without a rate; that limit is not new here either, and the head of Section 8 says where it does come from. The one regime of [28] that does not arise here at all is that in which the ratio ℓ ( x ) / L ( x ) of the two slowly varying factors degenerates: the standing hypotheses of Section 2 force its limit Λ ∞ to be finite and positive.
The rest of the paper is arranged as follows. Section 2 describes the model, fixes the Karamata classes in Section 2.2 and states the standing hypotheses. Section 3 is devoted to the exact identity and to the Basic Lemma of the critical branching system that follows from it, together with the survival probability, the local probability p 1 ( t ) of finding that system in state 1, and the generating function of the invariant measure of the branching system without immigration. Section 4 stays with that system and gives rates for the conditioned transition functions and for the local ratios. Section 5 returns to the system with immigration and contains the classification theorem, and Section 6, Section 7 and Section 8 treat, in turn, the transient regime γ < 0 , the boundary γ = 0 and the positive recurrent regime γ > 0 ; each of them identifies the limiting generating function and the exact rate of approach to it. Section 9 carries every rate of the paper from the generating functions to the individual transition probabilities, by a complex-analytic argument resting on a factorisation that criticality forces and needing no monotonicity hypothesis. Section 10 carries out a numerical verification on explicit models in which every constant of the paper can be computed independently. Section 11 collects concluding remarks and the questions that remain open.
It remains to say how the present paper stands to the treatment of [17], of which it is the direct continuation. Section 2, Section 3 and Section 4 revisit material treated there; we have retained only what the new results need, and in each case the statement given here supersedes its earlier counterpart. The hypotheses are now placed on the index functions of the two slowly varying factors rather than on their shift remainders; the two formulations are related by Lemma 2, and the constants of the earlier one are to be read through the factor ν / ( 1 − μ − ν ) appearing there. The implicitly defined normalising function N ( * ) of that treatment is superfluous under the present hypotheses and has been replaced throughout by the explicit constant 1 / L ∞ 1 / ν ; see Remark 2. The normalisation of the transient regime carries the constant Λ ∞ , so that the hypothesis Λ ∞ = | γ | of the earlier version is not needed.
The generating function M ( s ) of the invariant measure of the system without immigration is given here by Corollary 1. Its last term is absent from the expression stated as [17, Thm. 7], which therefore holds as an identity precisely when L ( * ) is constant, and in particular in the classical finite variance case, where the distinction does not arise; for a genuinely varying L ( * ) the two differ by a factor of the order of unity which tends to 1 only as s ↑ 1 , as Section 10 shows. The statements of Section 4 that rest on M ( s ) are restated accordingly. The range of the indices is also wider, both being allowed to take the value 1: the earlier treatment assumes ν , δ ∈ ( 0 , 1 ) , so that the classical finite variance case ν = δ = 1 lies outside its range, whereas here it is a point of the boundary stratum and is covered by Theorem 10.
Nor is any normalisation imposed on the constants. In that treatment the shift remainders of the two slowly varying factors are written ω ( * ) and ψ ( * ) , the two constants λ ω : = lim x → ∞ x ν ω ( x ) and λ ψ : = lim x → ∞ x δ ψ ( x ) are formed from them, and the constant that governs the transient regime is their ratio λ ψ / λ ω , on which the hypothesis of that regime is imposed. The constant that governs the same regime here is Λ ∞ of (13), the ratio of the two limits ℓ ∞ and L ∞ . The two agree, but only because the remainders are narrowed there by x ν ω ( x ) / L ( x ) → 1 as x → ∞ and its analogue for ψ ( * ) , which force λ ω = L ∞ and λ ψ = ℓ ∞ . That these are hypotheses and not identities is what (10) below shows: it gives
λ ω = c L ν ( 1 − μ − ν ) and λ ψ = c ℓ δ ( 1 − μ − δ ) ,
the second by the analogue of (10) for ℓ ( * ) under ( B ) . Each narrowing is therefore a relation between two of our four constants, depending on the shift μ besides, and together they cut a set of codimension two out of the parameter space. Under the Basic Axioms nothing of the kind is assumed: c L , c ℓ , L ∞ and ℓ ∞ are independent and enter the results separately, and the ratio λ ψ / λ ω is then not Λ ∞ .
Section 5, Section 7, Section 8, Section 9 and Section 10 have no counterpart in [17]. Some of them, and also Section 4, have one elsewhere, and the boundary between what is taken over and what is added should be said plainly. The classification of Section 5 is the evaluation, under the standing hypotheses, of a criterion that is classical and is recalled at (52) below; its content is the boundary stratum, the two other strata being the dichotomy already read off from that criterion in [18,25]. The limiting generating function of the positive recurrent regime of Section 8 is that of [18, Thm. 1.2], and the rate of approach to it, with its constant, is [16, Thm. 2.1]; what is added there is a rate expressed in constants rather than in slowly varying factors, the monotonicity and the uniformity of the approach, and the passage to the transition probabilities. The two limits of Section 4, finally, are, up to notation, [17, Thms. 8, 9], with M ( s ) there in the reduced form that Corollary 1 corrects; what is added there is the second-order correction of Theorem 4 below, its uniformity in s, and the transfer to the individual probabilities. The head of each of the three sections points back to here.

2. The Model and the Standing Hypotheses

2.1. The Branching-Immigration System

Let N be the set of natural numbers, let N 0 : = { 0 } ∪ N and let T : = [ 0 , ∞ ) be the time axis. We consider a population of monotype individuals. Each individual alive at time t ∈ T , independently of its history and of all other individuals, is transformed during ( t , t + ς ) according to the rule that it produces j ∈ N 0 ∖ { 1 } offspring with probability a j ς + o ( ς ) , and with probability 1 + a 1 ς + o ( ς ) either survives without reproducing or produces exactly one offspring, all as ς ↓ 0 . The branching rates { a j , j ∈ N 0 } satisfy a j ≥ 0 for j ∈ N 0 ∖ { 1 } together with the consistency condition
0 < a 0 < − a 1 = ∑ j ∈ N 0 ∖ { 1 } a j .
Independently of the branching mechanism, j ∈ N new individuals enter the population during ( t , t + ς ) with probability b j ς + o ( ς ) , and no immigration occurs with probability 1 + b 0 ς + o ( ς ) , again as ς ↓ 0 . The immigration intensities satisfy b j ≥ 0 for j ∈ N and 0 < − b 0 = ∑ k ∈ N b k < ∞ . Immigrants reproduce according to the same branching rates. The two mechanisms are encoded by the infinitesimal generating functions
f ( s ) : = ∑ k ∈ N 0 a k s k and h ( s ) : = ∑ k ∈ N 0 b k s k
for s ∈ [ 0 , 1 ) . Both vanish at s = 1 , and f ( 0 ) = a 0 > 0 , h ( 0 ) = b 0 < 0 . The resulting stochastic model is called the continuous-time Markov branching-immigration system, abbreviated MBIS. Its relation to the discrete-time model is the embedding problem of Karlin and McGregor [22].
Write X ( t ) for the population size at time t ∈ T . The process { X ( t ) , t ∈ T } is a homogeneous continuous-time Markov chain on a state space E ⊆ N 0 with transition functions
p i j ( t ) : = P i { X ( t ) = j } = P { X ( u + t ) = j | X ( u ) = i }
for i , j ∈ E and u , t ∈ T ; here t is the length of the transition interval and not an infinitesimal quantity. We take E to be the set of states reachable from 0. Because a 0 > 0 , every line of descent can die out, so that 0 is reachable from each state of E ; hence E is a single communicating class and the chain is irreducible on it. One has E = N 0 as soon as b 1 > 0 , and nothing below depends on which subset E is. The chain is also honest, that is non-explosive: the total jump rate of an individual is | a 1 | < ∞ , the total immigration rate is | b 0 | < ∞ , and in the critical case the branching part cannot explode; see [3, Ch. III] and [2, Ch. 2]. The generating function P i ( t ; s ) : = ∑ j ∈ E p i j ( t ) s j is a power series with nonnegative coefficients of sum at most 1, so that it converges absolutely on the closed unit disc and is analytic on the open one, and the same holds for F ( t ; s ) below. The remaining generating functions of the paper have nonnegative coefficients as well, and each is shown analytic on | s | < 1 where it is introduced. We nevertheless write the argument as a real s ∈ [ 0 , 1 ) throughout, the sole exception being Section 9, where the extension to complex s is precisely what carries the results to the individual transition probabilities. The generating function admits the representation
P i ( t ; s ) = [ F ( t ; s ) ] i exp { ∫ 0 t h ( F ( u ; s ) ) d u } ,
where F ( t ; s ) solves the backward
∂ F ( t ; s ) ∂ t = f ( F ( t ; s ) )
and the forward
∂ F ( t ; s ) ∂ t = f ( s ) ∂ F ( t ; s ) ∂ s
Kolmogorov equations subject to F ( 0 ; s ) = s ; see [18,19,25,26,30,36].
Switching the immigration off amounts to h ( s ) ≡ 0 , that is, to b k = 0 for every k ∈ N 0 . What remains is the Markov branching system without immigration, abbreviated MBS, whose population size we denote by Z ( t ) . It is a reducible chain on S 0 = { 0 } ∪ S with S ⊆ N a communicating class of transient states and { 0 } absorbing, and
∑ j ∈ S 0 p i j ( t ) s j = [ F ( t ; s ) ] i , where F ( t ; s ) = ∑ k ∈ S 0 p k ( t ) s k
and p k ( t ) : = P { Z ( t ) = k | Z ( 0 ) = 1 } . Thus F ( t ; s ) is common to both systems, and (1) exhibits the MBIS as the immigration stream superposed on it. The extinction probability of the MBS is the smallest root of f ( s ) = 0 in [ 0 , 1 ] , and F ( t ; s ) converges to it as t → ∞ , uniformly in s ∈ [ 0 , d ] for each d < 1 ; see [30].
Differentiating (1) at s = 1 gives
E [ X ( t ) | X ( 0 ) = 0 ] = ∂ P 0 ( t ; s ) ∂ s | s = 1 = h ′ ( 1 − ) a ( e a t − 1 ) , if a ≠ 0 , b e g i n e q u a t i o n 3 m m ] h ′ ( 1 − ) t , if a = 0 ,
where a = f ′ ( 1 − ) and, here and throughout, the argument 1 − marks the limit as the variable increases to 1. Formula (4) shows that the growth of the mean is governed by the sign of a alone: the system is subcritical, critical or supercritical according as a < 0 , a = 0 or a > 0 , and in the first two cases the extinction probability equals 1. Throughout the paper the system is critical, so that
f ( 1 ) = 0 and f ′ ( 1 − ) = 0 .
In particular f ( s ) > 0 on [ 0 , 1 ) , because f ( s ) is convex with f ( 1 ) = f ′ ( 1 − ) = 0 ; and h ( s ) < 0 on [ 0 , 1 ) , because h ( s ) is nondecreasing with h ( 1 ) = 0 and h ( s ) ¬ ≡ 0 . Finally, (1) shows that P i ( t ; s ) / P 0 ( t ; s ) → 1 as t → ∞ for every i ∈ E , the extinction probability being 1, so that it suffices throughout to study
P ( t ; s ) : = P 0 ( t ; s ) = exp { ∫ 0 t h ( F ( u ; s ) ) d u } ,
whose value at s = 0 is the return probability p 00 ( t ) .

2.2. Karamata Classes and the Index Function

A positive measurable function L ( * ) defined on a neighbourhood of infinity is slowly varying at infinity if L ( μ x ) / L ( x ) → 1 as x → ∞ for every μ > 0 ; the class of such functions is denoted SV ∞ . A function V ( * ) is regularly varying at infinity with index ρ , written V ( * ) ∈ RV ∞ ( ρ ) , if V ( x ) = x ρ L ( x ) for some L ( * ) ∈ SV ∞ . The representation theorem states that every L ( * ) ∈ SV ∞ can be written as
L ( x ) = c ( x ) exp ∫ x 0 x ε ( u ) u d u
with c ( x ) → c 0 ∈ ( 0 , ∞ ) and ε ( x ) → 0 as x → ∞ ; if c ( * ) is constant then L ( * ) is called normalised, and in that case L ( * ) is differentiable with
ε L ( x ) : = x L ′ ( x ) L ( x ) and L ( x ) = L ( x 0 ) exp ∫ x 0 x ε L ( u ) u d u .
We call ε L ( * ) the index function of L ( * ) . All slowly varying functions occurring below are normalised, so that the index function is defined; see [6, §1.3].
Most of the literature on branching systems controls the fine structure of L ( * ) not through the index function but through a remainder in the shift relation, one writing L ( μ x ) / L ( x ) = 1 + w μ ( x ) and postulating a decay rate for w μ ( * ) , after which the subscript μ is suppressed and w ( * ) : = w μ ( * ) is treated as a single function; the subclass of SV ∞ so obtained is recalled at (7) below, where our own hypotheses are placed inside it. Both devices have been used, and the passage between them, with the classification of remainders it induces, is the subject of [20]. What is not harmless is the suppression of μ : it is a notation and not an identification, since what the proofs actually use is the index function, and the two are proportional with a factor that depends on the shift and is not identically unity, as Lemma 2 below makes precise. We therefore place the hypotheses on the index function itself throughout.

2.3. Standing Hypotheses

The generating functions are assumed regularly varying at the point 1:
f ( s ) = ( 1 − s ) 1 + ν L ( 1 1 − s )
and
h ( s ) = − ( 1 − s ) δ ℓ ( 1 1 − s )
for s ∈ [ 0 , 1 ) , where ν , δ ∈ ( 0 , 1 ] and L ( * ) , ℓ ( * ) ∈ SV ∞ are normalised. Hypothesis [ f ν ] says that the offspring law lies in the domain of attraction of a ( 1 + ν ) -stable law, the hypothesis under which the theory of the critical system without immigration has been developed since Slack [37] and Seneta [34]; see also Vatutin [39] and Pakes [33]. It forces f ′ ′ ( 1 − ) = ∞ when ν < 1 , while ν = 1 with L ( x ) tending to a positive limit as x → ∞ is the finite variance case, f ′ ′ ( 1 − ) being twice that limit. Hypothesis [ h δ ] says that the immigration law has finite moments of every order below δ and, once ℓ ( * ) is bounded away from zero at infinity, as it is under ( B ) below, infinite moment of order δ when δ < 1 , while δ = 1 with ℓ ( x ) → h ′ ( 1 − ) as x → ∞ is the finite immigration mean case. Two parameters control everything that follows:
γ : = δ − ν and χ : = 2 δ − ν .
The fine structure of the two slowly varying factors is controlled by their index functions. We assume
x ν ε L ( x ) ⟶ c L ∈ [ 0 , ∞ ) as x → ∞
and
x δ ε ℓ ( x ) ⟶ c ℓ ∈ [ 0 , ∞ ) as x → ∞ .
Where an exact remainder is needed we strengthen these to their quantitative forms
x ν ε L ( x ) = c L + O ( x − ρ L ) as x → ∞
and
x δ ε ℓ ( x ) = c ℓ + O ( x − ρ ℓ ) as x → ∞
for some ρ L > 0 and ρ ℓ > 0 , and we write
ρ * : = min { ν , δ , ρ L , ρ ℓ }
for the joint rate they produce. Hypotheses [ f ν ] , [ h δ ] , ( A ) and ( B ) together are referred to as the Basic Axioms.
The two constants c L and c ℓ are allowed to vanish, and the case in which both do is not a degenerate one but the classical one: for L ( * ) and ℓ ( * ) constant the index functions vanish identically, so that c L = c ℓ = 0 , and [ f ν ] at ν = δ = 1 is the finite variance case. Nothing below is empty there: the expansion (29) below simply loses its logarithmic term, and the rate (75) below keeps the constant it has. Positivity is required at exactly two points of the paper, and is hypothesised there rather than here: c L > 0 in Lemma 2, where the index function is divided by the shift remainder, and c ℓ > 0 in Theorem 7, where it is what makes the leading term of the transient rate the one displayed; what happens at c ℓ = 0 is written out in Remark 7.
Hypotheses ( A * ) and ( B * ) are quantitative statements of membership in the Karamata subclass of slowly varying functions with remainder. Given a positive nonincreasing function α ( x ) with α ( x ) → 0 as x → ∞ , a function L ( * ) ∈ SV ∞ is said to be slowly varying with remainder α ( * ) , written L ( * ) ∈ SR ∞ ( α ) , if
L ( μ x ) L ( x ) = 1 + O ( α ( x ) ) as x → ∞
for every μ > 0 ; this is condition SR1 of [6, Ch. III,§3.12.1], the class and its calculus going back to Bojanic and Seneta [7], to Aljančić and Arandjelović [1] and to Goldie and Smith [12]; see also Geluk and de Haan [11]. The asymptotic theory of the critical branching system with infinite offspring variance has been developed precisely in this subclass, with the calibration α ( x ) = O ( L ( x ) / x ν ) for the offspring factor and α ( x ) = O ( ℓ ( x ) / x δ ) for the immigration one; see [18, Thms. 1.2, 1.3] and the hypotheses preceding them. In that calibration, membership in SR ∞ ( α ) is, by [6, Cor. 3.12.3], equivalent to L ( x ) = L ∞ + O ( α ( x ) ) as x → ∞ , so that the finite positive limit is forced by the subclass itself and is not an extra assumption; Lemma 1 below obtains the same conclusion from the index function.
Our axioms lie inside that subclass, and Lemma 2 makes the inclusion explicit: ( A ) gives L ( * ) ∈ SR ∞ ( x − ν ) with the exact constant c L ( 1 − μ − ν ) / ν in place of the O of (7), and the same holds for ℓ ( * ) with δ and c ℓ in place of ν and c L under ( B ) . Two things are gained by placing the hypotheses on the index function rather than on the remainder of (7). The remainder of (7) depends on the shift μ while the index function does not, so that every constant obtained below is shift-free; and the second-order rates ρ L , ρ ℓ of ( A * ) and ( B * ) have no counterpart in (7), whose O carries no constant at all; it is these two rates, through ρ * of (6), that turn every o ( 1 ) of the paper into an explicit power of t.
It should be said at once what the Basic Axioms do and do not allow. By Lemma 1 below, hypothesis ( A ) forces L ( x ) to have a finite positive limit, so that [ f ν ] together with ( A ) is a condition of regular variation of the second order in the sense of de Haan and Stadtmüller [13],
f ( s ) = ( 1 − s ) 1 + ν [ L ∞ + O ( ( 1 − s ) ν ) ] as s ↑ 1 ,
rather than a condition of plain regular variation: a factor such as L ( x ) = ln x is excluded. What is retained is the essential feature of the problem, namely f ′ ′ ( 1 − ) = ∞ for ν < 1 , and what is gained is that every constant below is finite and explicit. The same remark applies to [ h δ ] and ( B ) . Hypotheses of this kind are exactly those under which the shift remainder of the earlier formulations decays at the rate O ( x − ν ) postulated there; see Lemma 2 and Remark 1.
Two consequences of the Basic Axioms are used constantly and are recorded at once.
Lemma 1. 
Let ( A ) hold. Then the limit L ∞ : = lim x → ∞ L ( x ) exists in ( 0 , ∞ ) and
L ∞ − L ( x ) = L ∞ c L ν x ν + o ( x − ν ) as x → ∞ .
If moreover ( A * ) holds, then the o ( x − ν ) in (8) is O ( x − ν − min { ν , ρ L } ) . Finally
L ′ ( x ) = O ( x − 1 − ν ) , so that L ( y ) − L ( x ) = O ( ( y − x ) x − 1 − ν )
as x → ∞ , uniformly in y ∈ [ x , 2 x ] . The same statements hold for ℓ ( * ) with ν, c L , ρ L replaced by δ, c ℓ , ρ ℓ , the limit being denoted ℓ ∞ .
Proof. 
By ( A ) we have ε L ( u ) = O ( u − ν ) as u → ∞ , so that the integral
∫ x 0 ∞ [ ε L ( u ) / u ] d u
converges absolutely. Since
L ( x ) = L ( x 0 ) exp ∫ x 0 x [ ε L ( u ) / u ] d u ,
the limit L ∞ exists and is finite, and it is positive because the exponent is bounded. In the shift-remainder formulation the same conclusion is known; see [19]. Writing
L ∞ − L ( x ) = L ∞ ( 1 − exp { − ∫ x ∞ ε L ( u ) u d u } )
and using 1 − e − y = y + O ( y 2 ) as y → 0 together with
∫ x ∞ ε L ( u ) u d u = ∫ x ∞ u ν ε L ( u ) u 1 + ν d u = c L ν x ν + o ( x − ν )
gives (8); the quadratic term of 1 − e − y contributes O ( x − 2 ν ) , which is o ( x − ν ) . The additive form is the one needed: the constant c L is allowed to vanish by ( A ) , and a relative remainder would then assert that L ( * ) is constant. Under ( A * ) the last display carries the remainder O ( x − ν − ρ L ) , and together with the quadratic term this is the asserted bound. Finally L ′ ( x ) = L ( x ) ε L ( x ) / x , and the first half of (9) follows because L ( * ) is bounded and ε L ( x ) = O ( x − ν ) as x → ∞ ; the second half is the first integrated over [ x , y ] , the integrand being of the constant order x − 1 − ν throughout [ x , 2 x ] . □
Lemma 2. 
Let ( A ) hold with c L > 0 and put w μ ( x ) : = L ( μ x ) / L ( x ) − 1 . Then for every μ > 0
x ν w μ ( x ) ⟶ c L ν ( 1 − μ − ν ) as x → ∞ .
In particular w μ ( x ) = O ( x − ν ) as x → ∞ for every μ > 0 ; relation (10), in which the limit is a function of μ, places L ( * ) in the class S R 2 of [6], treated for its own sake in [20]. Moreover
ε L ( x ) w μ ( x ) ⟶ ν 1 − μ − ν as x → ∞ .
Proof. 
Since
ln [ 1 + w μ ( x ) ] = ∫ x μ x [ ε L ( u ) / u ] d u
and ε L ( u ) = c L u − ν ( 1 + o ( 1 ) ) as u → ∞ , the integral equals ( c L / ν ) x − ν ( 1 − μ − ν ) ( 1 + o ( 1 ) ) as x → ∞ ; expanding the logarithm gives (10), and assertion (11) follows on dividing by ε L ( x ) ∼ c L x − ν as x → ∞ . □
Remark 1. 
Relation (10) shows that the shift remainder w μ ( * ) does carry the decay rate O ( x − ν ) postulated in the earlier formulations, so the Basic Axioms in the present form are at least as strong as those of the earlier formulations discussed in Section 1. Relation (11) shows in what sense they are more precise. The factor ν / ( 1 − μ − ν ) depends on the shift and exceeds ν for every μ > 1 , taking the value 1 only on the curve μ = ( 1 − ν ) − 1 / ν of the parameter plane, and never at all when ν = 1 . The index function and the shift remainder can therefore not be identified with one another: a constant computed by replacing one with the other differs from the true one by that factor. Working with ε L ( * ) from the outset removes the difficulty, and with it the arbitrariness of the choice of μ.
We shall also use throughout the two auxiliary functions
V ( y ) : = y ν L ( 1 / y ) and Λ ( x ) : = ℓ ( x ) L ( x )
for y ∈ ( 0 , 1 ] and x ≥ 1 , together with the constant
Λ ∞ : = lim x → ∞ Λ ( x ) = ℓ ∞ L ∞ ∈ ( 0 , ∞ ) ,
whose existence is guaranteed by Lemma 1. The constant Λ ∞ of (13) is the single number through which the immigration mechanism enters every limit theorem below. Hypothesis [ f ν ] gives
V ( 1 ) = L ( 1 ) = a 0 .
Finally we record, for later use, the elementary consequence of Lemma 1 that
Λ ∞ − Λ ( x ) = Λ ∞ [ c ℓ δ x δ − c L ν x ν ] + o ( x − min { ν , δ } ) as x → ∞ ,
which is obtained by writing
Λ ∞ − Λ ( x ) = ℓ ∞ ( L ( x ) − L ∞ ) + L ∞ ( ℓ ∞ − ℓ ( x ) ) L ∞ L ( x )
and inserting (8) and its analogue for ℓ ( * ) . The bracket in (15) may vanish identically, as it does when ν = δ and c ℓ = c L , and in particular in the classical case c L = c ℓ = 0 ; this is why the remainder there is additive and not relative. If moreover ( A * ) and ( B * ) hold, then the same computation carried one step further sharpens the o-term of (15) to an explicit power,
Λ ∞ − Λ ( x ) = Λ ∞ [ c ℓ δ x δ − c L ν x ν ] + O ( x − min { ν , δ } − ρ * ) as x → ∞ ,
with ρ * of (6): by Lemma 1 the two numerators carry the errors O ( x − ν − min { ν , ρ L } ) and O ( x − δ − min { δ , ρ ℓ } ) , and the expansion of 1 / L ( x ) about 1 / L ∞ contributes O ( x − min { ν , δ } − ν ) .

3. The Basic Lemma of the Critical Branching System

Throughout this section we work with the critical MBS { Z ( t ) , t ∈ T } generated by the infinitesimal generating functions f ( s ) alone, and with
R ( t ; s ) : = 1 − F ( t ; s ) and τ ( t ; s ) : = 1 R ( t ; s ) ,
together with the abbreviations
τ ( t ) : = τ ( t ; 0 ) and q ( t ) : = R ( t ; 0 ) .
The quantity q ( t ) = P { Z ( t ) ∈ S } is the survival probability of the system started by a single ancestor. A statement describing the asymptotic behaviour of τ ( t ; s ) is traditionally called the Basic Lemma of the theory of critical branching systems; under hypotheses of the present kind it goes back to Zolotarev [41] in continuous time and to Slack [37] and Seneta [34] in discrete time. We shall obtain it from an identity that is exact, and it is the exactness that makes the constants below accessible. We need the generating function of the invariant measure of the MBS,
M ( s ) : = ∫ 0 s 1 f ( x ) d x = ∫ 1 1 / ( 1 − s ) 1 x 1 − ν L ( x ) d x ,
the second equality following from [ f ν ] and the substitution 1 − x = 1 / u . Its coefficients are written m j throughout, so that M ( s ) = ∑ j ∈ S m j s j for s ∈ [ 0 , 1 ) ; that M ( * ) is analytic on the whole unit disc, and hence that the expansion converges there, is part of Lemma 9 below, whose proof uses nothing from the intervening sections. Together with it we use the integral
I ( X ) : = ∫ 1 X x ν L ′ ( x ) L 2 ( x ) d x ,
which is finite for every X ≥ 1 and nondecreasing when ε L ( * ) ≥ 0 .
Lemma 3. 
Let [ f ν ] hold. Then for every s ∈ [ 0 , 1 ) and every t ∈ T
1 V ( R ( t ; s ) ) = ν [ t + M ( s ) ] + 1 a 0 − I ( τ ( t ; s ) ) .
Proof. 
Differentiating Y ν / L ( Y ) and integrating the result over [ 1 , X ] gives
X ν L ( X ) − 1 L ( 1 ) = ν ∫ 1 X 1 Y 1 − ν L ( Y ) d Y − I ( X ) ,
valid for every X ≥ 1 . Take X = τ ( t ; s ) . The left-hand side is 1 / V ( R ( t ; s ) ) − 1 / a 0 by (12) and (14). In the integral on the right-hand side substitute Y = 1 / ( 1 − x ) and use (17): it equals M ( F ( t ; s ) ) , because τ ( t ; s ) = 1 / ( 1 − F ( t ; s ) ) . Finally the backward equation (2) gives
d M ( F ( t ; s ) ) / d t = f ( F ( t ; s ) ) / f ( F ( t ; s ) ) = 1 ,
whence M ( F ( t ; s ) ) = M ( s ) + t , and (19) follows. □
Identity (19) is exact; it involves no asymptotics and no hypothesis beyond [ f ν ] . Everything in this section is read off from it once the growth of I ( * ) is known. Put
ϑ : = c L L ∞ and ρ 0 : = min { ν , ρ L } .
Lemma 4. 
Let ( A ) hold. Then
I ( X ) = ϑ ln X + o ( ln X ) as X → ∞ .
If in addition ( A * ) holds, then the constant
κ L : = ∫ 1 ∞ [ x ν L ′ ( x ) L 2 ( x ) − ϑ x ] d x
is finite and
I ( X ) = ϑ ln X + κ L + O ( X − ρ 0 ) as X → ∞ .
Proof. 
Recall the notation (20) and write the integrand of (18) as
x ν L ′ ( x ) L 2 ( x ) = 1 x · x ν ε L ( x ) L ( x ) ,
which is legitimate because ε L ( x ) = x L ′ ( x ) / L ( x ) . By ( A ) and Lemma 1 the second factor tends to c L / L ∞ = ϑ , and (21) follows on integrating. Under ( A * ) the deviation of that factor from its limit is
x ν ε L ( x ) L ( x ) − ϑ = x ν ε L ( x ) − c L L ( x ) + c L L ∞ − L ( x ) L ∞ L ( x ) = O ( x − ρ L ) + O ( x − ν ) ,
by Lemma 1. Dividing by x produces an absolutely integrable function on [ 1 , ∞ ) , so κ L is finite, and the tail of the integral is O ( X − ρ 0 ) , which is (23). □
Lemma 4, and likewise every tail estimate of Section 6, Section 7 and Section 8, is the index-function counterpart of the general asymptotics of integrals of Karamata functions with a controlled remainder, for which see [7,12] and [6, §3.12]; we prove the versions we need inline, because what is wanted here is not the order of the tail but the exact constant in front of it, and that constant is c L or c ℓ rather than the shift remainder. Combining Lemmas 3 and 4 gives the Basic Lemma in the form in which it will be used.
Theorem 1. 
Let [ f ν ] and ( A ) hold. Then, uniformly in s ∈ [ 0 , d ] for every d < 1 ,
1 V ( R ( t ; s ) ) = ν [ t + M ( s ) ] + 1 a 0 − ϑ ln τ ( t ; s ) + o ( ln t ) as t → ∞ .
If in addition ( A * ) holds, then the remainder is exact:
1 V ( R ( t ; s ) ) = ν [ t + M ( s ) ] + 1 a 0 − κ L − ϑ ln τ ( t ; s ) + O ( t − ρ 0 / ν ) as t → ∞ ,
uniformly in s ∈ [ 0 , d ] .
Proof. 
Insert (21) and (23) into (19). For the uniformity note that R ( t ; s ) ≤ R ( t ; 0 ) = q ( t ) for s ∈ [ 0 , d ] and R ( t ; s ) ≥ R ( t ; d ) , so that
τ ( t ) ≤ τ ( t ; s ) ≤ τ ( t ; d ) for every s ∈ [ 0 , d ] and t ∈ T ;
since M ( s ) ≤ M ( d ) < ∞ on [ 0 , d ] , identity (19) read together with (26) forces τ ( t ; s ) ≍ τ ( t ) uniformly on [ 0 , d ] , and in particular
τ − ρ 0 ( t ; s ) = O ( τ − ρ 0 ( t ) ) as t → ∞ ,
uniformly on [ 0 , d ] . That τ ( t ) is of exact order t 1 / ν is the content of (28) in Theorem 2 below, and with (27) it turns the remainder O ( τ − ρ 0 ( t ; s ) ) of (23) into the uniform O ( t − ρ 0 / ν ) of (25). The proof of Theorem 2 uses (19) at s = 0 and (21) only, so that the order of proof is (19), (21), (28), (24) and there is no circularity. □
The choice s = 0 in Theorem 1, for which M ( 0 ) = 0 and τ ( t ; 0 ) = τ ( t ) , yields the survival probability. The expansion below has three terms and no unspecified constants.
Theorem 2. 
Let [ f ν ] and ( A ) hold. Then
q ( t ) = ( ν L ∞ t ) − 1 / ν ( 1 + o ( 1 ) ) as t → ∞ .
If in addition ( A * ) holds, then
1 q ν ( t ) = ν L ∞ t − c L ν ln ( ν L ∞ t ) + c + o ( 1 ) as t → ∞ ,
where the constant, built from κ L of (22), is
c : = L ∞ [ 1 a 0 − κ L ] − c L ν ,
and equivalently
q ( t ) = ( ν L ∞ t ) − 1 / ν { 1 + c L ln ( ν L ∞ t ) − ν c ν 3 L ∞ t + o ( 1 / t ) } as t → ∞ .
Proof. 
Put s = 0 in (19). Since
1 / V ( q ( t ) ) = τ ν ( t ) / L ( τ ( t ) )
and L ( τ ( t ) ) → L ∞ as t → ∞ , relation (21) applied to I ( τ ( t ) ) gives τ ν ( t ) = L ∞ ν t ( 1 + o ( 1 ) ) as t → ∞ , which is (28). Under ( A * ) we use (23) instead and multiply by L ( τ ( t ) ) :
τ ν ( t ) = L ( τ ( t ) ) [ ν t + 1 a 0 − κ L − ϑ ln τ ( t ) ] + O ( τ − ρ 0 ( t ) ) .
By Lemma 1,
L ( τ ( t ) ) = L ∞ − ( L ∞ c L / ν ) τ − ν ( t ) + o ( τ − ν ( t ) ) ;
since τ − ν ( t ) ν t → 1 / L ∞ as t → ∞ by (28), the product of the first correction with ν t contributes exactly − c L / ν , that of the second is o ( 1 ) , and the product of both with the remaining bounded terms is o ( 1 ) . Because L ∞ ϑ = c L and
ln τ ( t ) = 1 ν ln τ ν ( t ) = 1 ν ln ( ν L ∞ t ) + o ( 1 ) as t → ∞
by (28), we arrive at
τ ν ( t ) = ν L ∞ t − c L ν ln ( ν L ∞ t ) + L ∞ [ 1 a 0 − κ L ] − c L ν + o ( 1 ) ,
which is (29). Raising (29) to the power − 1 / ν gives (31). □
Remark 2. 
In [17,18] the leading term of (28) is written as N ( t ) / ( ν t ) 1 / ν , where N ( * ) ∈ SV ∞ is defined implicitly by
N ν ( t ) L ( ( ν t ) 1 / ν / N ( t ) ) → 1 .
Under the Basic Axioms the auxiliary function is superfluous: by Lemma 1 the slowly varying factor L ( * ) has a finite positive limit, so that N ( t ) → 1 / L ∞ 1 / ν as t → ∞ and the normalisation is the explicit power ( ν L ∞ t ) − 1 / ν . We therefore do not use N ( * ) anywhere below.
The comparison extends to the second term, and there the two accounts differ. Written in the notation of (20), the logarithmic correction of [17] is the one carried by (29) and (31) when ϑ = 1 , whereas under the Basic Axioms ϑ is a free constant of the offspring generating function, equal to the limit of x ν ε L ( x ) / L ( x ) ; Model T of Section 10 has ϑ = 0.2 . The origin of the difference is the one recorded in Remark 1. The hypothesis there is imposed on the shift remainder w μ ( * ) and reads x ν w μ ( x ) / L ( x ) → 1 as x → ∞ ; by (11) that hypothesis gives ϑ = ν / ( 1 − μ − ν ) , a quantity which still depends on the shift, and the value ϑ = 1 is what the further identification of w μ ( * ) with ε L ( * ) produces. The coefficient is open to inspection in a closed-form model, as Section 10 shows.
The comparison of τ ( t ; s ) with τ ( t ) is needed in each of the sections that follow, and is recorded here once.
Lemma 5. 
Let [ f ν ] hold. Then for every s ∈ [ 0 , 1 ) and every t ∈ T
1 V ( R ( t ; s ) ) − 1 V ( q ( t ) ) = ν M ( s ) − [ I ( τ ( t ; s ) ) − I ( τ ( t ) ) ] ,
an identity in which the logarithmic terms of Theorem 1 cancel. If in addition ( A ) holds, then the bracket in (33) is O ( 1 / t ) and, uniformly in s ∈ [ 0 , d ] for every d < 1 ,
[ τ ( t ; s ) ] ν − [ τ ( t ) ] ν = ν L ∞ M ( s ) + O ( 1 / t ) as t → ∞
and
ln τ ( t ; s ) τ ( t ) = M ( s ) ν t + o ( 1 / t ) as t → ∞ .
In particular, uniformly in s ∈ [ 0 , d ] ,
0 ≤ τ ( t ; s ) − τ ( t ) = O ( τ 1 − ν ( t ) ) as t → ∞ .
Proof. 
Subtracting (19) at s = 0 from (19) at s gives (33). Let now ( A ) hold and fix d < 1 . The integrand of I ( * ) is 1 / x times x ν ε L ( x ) / L ( x ) , and the latter is bounded by ( A ) and Lemma 1; hence, with a constant C 0 and uniformly on [ 0 , d ] ,
| I ( τ ( t ; s ) ) − I ( τ ( t ) ) | ≤ C 0 ln τ ( t ; s ) τ ( t ) ≤ C 0 τ ( t ; s ) − τ ( t ) τ ( t ) .
Since τ ( t ; s ) ≍ τ ( t ) uniformly on [ 0 , d ] , as shown in the proof of Theorem 1, the bracket in (33) is bounded, so that τ ν ( t ; s ) / L ( τ ( t ; s ) ) − τ ν ( t ) / L ( τ ( t ) ) is bounded too; as L ( * ) has a finite positive limit, τ ( t ; s ) / τ ( t ) → 1 uniformly on [ 0 , d ] . Write D : = τ ν ( t ; s ) − τ ν ( t ) ≥ 0 and multiply (33) by L ( τ ( t ) ) ; since 1 / V ( R ( t ; s ) ) = τ ν ( t ; s ) / L ( τ ( t ; s ) ) this reads
D = L ( τ ( t ) ) [ ν M ( s ) − I ( τ ( t ; s ) ) + I ( τ ( t ) ) ] + τ ν ( t ; s ) L ( τ ( t ; s ) ) − L ( τ ( t ) ) L ( τ ( t ; s ) ) .
The mean value theorem applied to x ↦ x 1 / ν gives τ ( t ; s ) − τ ( t ) ≤ D τ 1 − ν ( t ; s ) / ν , because 1 / ν − 1 is nonnegative. By (37) the bracket term is therefore O ( D τ − ν ( t ) ) , and by (9) so is the last term, since
O ( τ ν ( t ; s ) D τ 1 − ν ( t ; s ) τ − 1 − ν ( t ) ) = O ( D τ − ν ( t ) ) ,
both uniformly on [ 0 , d ] . Both are o ( D ) , so that D = O ( 1 ) , and the bracket is of the order τ − ν ( t ) , that is O ( 1 / t ) by (28). Solving for D now gives (34), the replacement of L ( τ ( t ) ) by L ∞ costing O ( τ − ν ( t ) ) = O ( 1 / t ) by Lemma 1. Finally, by (34) and Theorem 2,
ln τ ( t ; s ) τ ( t ) = 1 ν ln [ 1 + ν L ∞ M ( s ) τ ν ( t ) + O ( 1 / t 2 ) ] = M ( s ) ν t + o ( 1 / t ) ,
which is (35). Finally (36) is the mean value bound above read with D = O ( 1 ) , obtained above, and τ ( t ; s ) ≍ τ ( t ) uniformly on [ 0 , d ] by (26). □
We turn to the derivative of R ( t ; s ) , which carries the local probabilities. Here too an exact identity is available.
Lemma 6. 
Let [ f ν ] hold. Then for every s ∈ [ 0 , 1 ) and t ∈ T
∂ R ( t ; s ) ∂ s = − R ( t ; s ) f ( s ) V ( R ( t ; s ) ) and in particular p 1 ( t ) = q ( t ) V ( q ( t ) ) a 0 .
Proof. 
Equating the right-hand sides of (2) and (3) gives ∂ F ( t ; s ) / ∂ s = f ( F ( t ; s ) ) / f ( s ) , so that ∂ R / ∂ s = − f ( 1 − R ) / f ( s ) ; and f ( 1 − R ) = R · V ( R ) by [ f ν ] and (12). Setting s = 0 and using ∂ R ( t ; s ) / ∂ s | s = 0 = − p 1 ( t ) together with f ( 0 ) = a 0 yields the second assertion. □
Theorem 3. 
Let [ f ν ] and ( A * ) hold, and put d : = 1 / a 0 − κ L . Then
p 1 ( t ) q ( t ) = 1 a 0 ν t { 1 + ϑ ln ( ν L ∞ t ) − ν d ν 2 t + o ( 1 / t ) } as t → ∞ ,
and consequently
t 1 + 1 / ν p 1 ( t ) ⟶ L ∞ a 0 ( ν L ∞ ) 1 + 1 / ν as t → ∞ .
Proof. 
By (38) the ratio p 1 ( t ) / q ( t ) equals V ( q ( t ) ) / a 0 , and V ( q ( t ) ) is the reciprocal of the left-hand side of (25), so that
p 1 ( t ) q ( t ) = V ( q ( t ) ) a 0 = 1 a 0 [ ν t + d − ϑ ln τ ( t ) + o ( 1 ) ]
by (25) with s = 0 . Expanding the bracket and using (32) gives (39). For (40) write p 1 ( t ) = q 1 + ν ( t ) L ( τ ( t ) ) / a 0 , again by (38) and (12), and insert (28). □
Finally we record the generating function M ( s ) itself. Setting t = 0 in Lemma 3 gives an identity that is worth isolating, because the form of M ( s ) enters the conditional limit theorems of Section 4.
Corollary 1. 
Let [ f ν ] hold. Then for every s ∈ [ 0 , 1 )
ν M ( s ) = 1 V ( 1 − s ) − 1 a 0 + I ( 1 1 − s ) .
Remark 3. 
The term I ( 1 / ( 1 − s ) ) in (41) cannot be dispensed with. It vanishes identically if and only if L ( * ) is constant, which by [ f ν ] and (14) means f ( s ) = a 0 ( 1 − s ) 1 + ν ; in the finite variance case ν = 1 one recovers the familiar M ( s ) = s / ( a 0 ( 1 − s ) ) . For a genuinely varying L ( * ) the reduced expression [ 1 / V ( 1 − s ) − 1 / a 0 ] / ν , obtained by suppressing that term, differs from M ( s ) by a factor of the order of unity rather than by a quantity of smaller order; the ratio of the two is given for Model T in Section 10. Since the two agree identically when L ( * ) is constant, the distinction is invisible in the finite variance theory and becomes visible only in the present generality.
It is also invisible in the limit s ↑ 1 . Under ( A ) the omitted term is I ( X ) = ϑ ln X + o ( ln X ) by (21), while 1 / V ( 1 − s ) grows like a power of 1 / ( 1 − s ) ; the reduced expression is therefore the correct leading term of M ( s ) as s ↑ 1 , and the ratio of the two tends to unity, as Figure 3 shows for Model T. This is why the omission leaves untouched every statement in which M ( * ) enters asymptotically or is carried symbolically, and shows itself only when the formula is read as an identity at a fixed s. It is so read in [17, Thm. 7], where the term I ( 1 / ( 1 − s ) ) is absent from the displayed expression for M ( s ) ; (41) is the corrected form, and it is the one used throughout the present paper.

4. The Conditioned Branching System and Local Ratios

We stay with the MBS without immigration for one more section and record two consequences of Lemma 3 that are of interest in their own right and that sharpen the classical conditional limit theorems of [23,32,33,37,38]. The limits themselves are known in the present generality; what is taken over and what is added is set out in Section 1, and we do not repeat it. What is added here is the second-order correction of Theorem 4 below, quadratic in M ( s ) , together with the uniformity in s and the transfer to the individual probabilities. Set
p j S ( t ) : = P { Z ( t ) = j | Z ( t ) ∈ S } = p j ( t ) q ( t ) and F S ( t ; s ) : = ∑ j ∈ S p j S ( t ) s j = 1 − R ( t ; s ) q ( t ) ,
the last equality being immediate from ∑ j ∈ S p j ( t ) s j = F ( t ; s ) − p 0 ( t ) . It is convenient to abbreviate
A ( t ) : = 1 V ( q ( t ) ) = ν t + d − ϑ ln τ ( t ) + o ( 1 ) as t → ∞ ,
the second equality being (25) at s = 0 under ( A * ) .
Theorem 4. 
Let [ f ν ] and ( A ) hold. Then, uniformly in s ∈ [ 0 , d ] for every d < 1 ,
A ( t ) F S ( t ; s ) = M ( s ) + O ( 1 / t ) as t → ∞ ,
and the deviation in (43) is itself computable to one order more,
F S ( t ; s ) = M ( s ) A ( t ) − ( 1 + ν ) M 2 ( s ) 2 A 2 ( t ) + o ( 1 / t 2 ) as t → ∞ ,
again uniformly in s ∈ [ 0 , d ] . If in addition ( A * ) holds, so that A ( t ) may be replaced by its expansion (42), then
ν t F S ( t ; s ) = M ( s ) { 1 + ϑ ln ( ν L ∞ t ) − ν d ν 2 t − ( 1 + ν ) M ( s ) 2 ν t + o ( 1 / t ) } as t → ∞ ,
uniformly in s ∈ [ 0 , d ] , the last term being the only part of the correction that carries a dependence on s.
Proof. 
Write A s ( t ) : = 1 / V ( R ( t ; s ) ) . By (12),
( R ( t ; s ) q ( t ) ) ν = V ( R ( t ; s ) ) V ( q ( t ) ) · L ( τ ( t ) ) L ( τ ( t ; s ) ) = A ( t ) A s ( t ) · L ( τ ( t ) ) L ( τ ( t ; s ) ) .
Identity (33) gives A s ( t ) = A ( t ) + ν M ( s ) + O ( 1 / t ) as t → ∞ . The second factor of (46) is not merely bounded: by (9) and the bound (36) of Lemma 5 it satisfies
L ( τ ( t ; s ) ) L ( τ ( t ) ) = 1 + O ( 1 / t 2 ) as t → ∞ ,
uniformly on [ 0 , d ] , the exact form of that factor being (48) below. Hence, as t → ∞ , one has R ( t ; s ) / q ( t ) = 1 − M ( s ) / A ( t ) + O ( 1 / t 2 ) , which is (43).
For (44) the two factors of (46) are needed one order further. In (33) the bracket is
I ( τ ( t ; s ) ) − I ( τ ( t ) ) = ∫ τ ( t ) τ ( t ; s ) I ′ ( x ) d x with I ′ ( x ) = x ν L ′ ( x ) L 2 ( x ) = ϑ x + o ( 1 x )
by ( A ) , so that by (35) the bracket equals ϑ M ( s ) / ( ν t ) + o ( 1 / t ) . Consequently
A s ( t ) − A ( t ) = ν M ( s ) − ϑ M ( s ) ν t + o ( 1 / t ) as t → ∞ .
For the second factor of (46), L ′ ( x ) = L ( x ) ε L ( x ) / x = L ∞ c L x − 1 − ν + o ( x − 1 − ν ) as x → ∞ , so that integration between the two arguments, using (34) and ϑ = c L / L ∞ , gives
L ( τ ( t ) ) L ( τ ( t ; s ) ) = 1 − ϑ M ( s ) ν 2 t 2 + o ( 1 / t 2 ) as t → ∞ .
Write y : = [ A s ( t ) − A ( t ) ] / A ( t ) with (47), and expand the product of the two factors of (46) to order t − 2 with (48). Taking the ν -th root by
( 1 − ϖ ) 1 / ν = 1 − ϖ ν + ( 1 − ν ) ϖ 2 2 ν 2 + O ( ϖ 3 ) with ϖ = y − y 2 + ϑ M ( s ) ν 2 t 2 + o ( 1 t 2 ) ,
the two terms in ϑ M ( s ) cancel, the two terms in y 2 combine with the coefficients − 1 / ν and − ( 1 − ν ) / ( 2 ν 2 ) , and (44) follows, uniformly on [ 0 , d ] . Nothing beyond ( A ) has been used to this point, A ( t ) having been carried unexpanded. It remains, under ( A * ) , to multiply (44) by ν t / M ( s ) and to insert (42) together with (32), which gives (45). □
Remark 4. 
The unnormalised form (44) is the sharper of the two, and it states the content of the theorem without constants: the deviation of A ( t ) F S ( t ; s ) from M ( s ) is asymptotically − ( 1 + ν ) M 2 ( s ) / ( 2 A ( t ) ) , quadratic in M ( s ) and negative. In the normalised form (45) the correction splits into a part free of s, namely the second-order term of the survival probability transported through A ( t ) , and the term − ( 1 + ν ) M ( s ) / ( 2 ν t ) , which is not. The latter is the first place at which the conditioned law is seen to approach its limit at a rate depending on the argument, and it is governed by M ( * ) alone. It does not disturb the ratio limit: dividing (45) at s 1 by the same relation at s 2 leaves M ( s 1 ) / M ( s 2 ) with a relative error of order 1 / t , so that the limit of the ratio is unaffected.
The corresponding statement for the ratios to p 1 ( t ) is even simpler, because of the exact formula (38). Let
V ( t ; s ) : = ∑ j ∈ S p j ( t ) p 1 ( t ) s j .
Theorem 5. 
Let [ f ν ] and ( A ) hold. Then, uniformly in s ∈ [ 0 , d ] for every d < 1 ,
V ( t ; s ) = a 0 M ( s ) + O ( 1 / t ) as t → ∞ ,
so that V ( t ; s ) → V ( s ) : = a 0 M ( s ) = ∑ j ∈ S v j s j as t → ∞ , with v j = a 0 m j . The v j are nonnegative, being by Theorem 12 below the limits of the nonnegative ratios p j ( t ) / p 1 ( t ) ; that theorem uses of the present one only (49), so the reference is not circular.
Proof. 
By definition
V ( t ; s ) = q ( t ) F S ( t ; s ) / p 1 ( t ) ,
and by (38)
q ( t ) / p 1 ( t ) = a 0 / V ( q ( t ) ) = a 0 A ( t ) .
Hence V ( t ; s ) = a 0 A ( t ) F S ( t ; s ) and (49) is (43). □
Read together with (40) of Theorem 3, the limit (49) is a local limit theorem for the branching system without immigration: writing p j ( t ) = p 1 ( t ) [ p j ( t ) / p 1 ( t ) ] one obtains
t 1 + 1 / ν p j ( t ) ⟶ L ∞ v j a 0 ( ν L ∞ ) 1 + 1 / ν as t → ∞
for each j ∈ S , the passage to the coefficients being legitimate by Theorem 12 below, which supplies it with a rate.
Remark 5. 
One point about the conditioned system should be recorded. The conditioned probabilities p j S ( t ) are obtained by conditioning on the event { Z ( t ) ∈ S } separately for each t ∈ T , and this operation does not produce a time-homogeneous Markov chain: the conditioning event changes with t, so the family { p j S ( t ) } does not satisfy the Kolmogorov–Chapman equation. The Q-process, which conditions on non-extinction in the remote future, is a genuine Markov chain precisely because its conditioning event does not depend on t; see [24,32]. The statements (43) to (49), and those of Section 9, concern the conditioned distributions alone and use no Markov property of them, so nothing below depends on the point; we make it only to explain why no such property is invoked.

5. Classification of the State Space

We now return to the system with immigration. Everything rests on the following change of variable, which converts the time integral in (1) into an integral over the state variable and is used again in each of the three sections that follow.
Lemma 7. 
Let [ f ν ] and [ h δ ] hold. Then for every s ∈ [ 0 , 1 ) and t ∈ T
ln P ( t ; s ) = − ∫ 1 / ( 1 − s ) τ ( t ; s ) Λ ( x ) x 1 + γ d x .
Proof. 
By the backward equation (2) the substitution u = F ( v ; s ) turns ∫ 0 t h ( F ( v ; s ) ) d v into ∫ s F ( t ; s ) [ h ( u ) / f ( u ) ] d u . By [ f ν ] , [ h δ ] and (5),
h ( u ) f ( u ) = − ℓ ( 1 / ( 1 − u ) ) L ( 1 / ( 1 − u ) ) 1 ( 1 − u ) 1 + ν − δ = − Λ ( 1 / ( 1 − u ) ) ( 1 − u ) 1 − γ ,
and the further substitution 1 − u = 1 / x , which carries u = F ( t ; s ) to x = τ ( t ; s ) , gives (51). □
The three regimes of (51) are governed by the sign of γ , because the integrand is asymptotically Λ ∞ x − 1 − γ : the integral diverges like a power of τ ( t ; s ) for γ < 0 , like a logarithm for γ = 0 , and converges for γ > 0 . This is the whole of the classification, and the threshold at the boundary is the coefficient of the logarithm.
The criterion that is being evaluated is classical, and it is worth writing down in order to see what the theorem below adds to it. The chain is irreducible and honest by Section 2, so that E is recurrent if and only if ∫ 0 ∞ p 00 ( t ) d t = ∞ and is positive recurrent if and only if p 00 ( t ) has a positive limit as t → ∞ ; see [2]. Since p 00 ( t ) is (1) at i = s = 0 and the substitution v = F ( t ; 0 ) , for which d v = f ( v ) d t by (2), carries t ∈ T onto v ∈ [ 0 , 1 ) , the first of the two integrals is
∫ 0 ∞ p 00 ( t ) d t = ∫ 0 1 1 f ( v ) exp { ∫ 0 v h ( u ) f ( u ) d u } d v .
In this form the criterion goes back to Pakes [30] and is developed in Chen and Renshaw [8] and in Li, Chen and Pakes [25]; the dichotomy between γ > 0 and γ < 0 is what reading it under [ f ν ] and [ h δ ] gives at once, and is recorded in [18,25]. The substance of the theorem below is therefore the boundary γ = 0 , where the sign carries no information and the two sides of (52) have to be separated by a second number; we state the three strata together because the classification is only complete when the boundary is included, and prove them from (51) at s = 0 rather than from (52), the exponent of (51) being available to us in closed form.
Theorem 6. 
Let the Basic Axioms hold. Then the state space E of the MBIS is
(i)
positive recurrent if γ > 0 ;
(ii)
null recurrent if γ = 0 and Λ ∞ ≤ ν , and transient if γ = 0 and Λ ∞ > ν ;
(iii)
transient if γ < 0 .
Proof. 
We use the two criteria recalled above. By (51) at s = 0 ,
ln p 00 ( t ) = − ∫ 1 τ ( t ) Λ ( x ) x 1 + γ d x ,
and by Theorem 2, τ ( t ) = ( ν L ∞ t ) 1 / ν ( 1 + o ( 1 ) ) as t → ∞ .
Let γ > 0 . Since Λ ( x ) → Λ ∞ and ∫ 1 ∞ x − 1 − γ d x < ∞ , the integral in (53) converges as t → ∞ , so that p 00 ( t ) tends to a strictly positive limit and (i) holds.
Let γ = 0 . Then (53) reads
ln p 00 ( t ) = − Λ ∞ ln τ ( t ) − ∫ 1 τ ( t ) Λ ( x ) − Λ ∞ x d x ,
and by (15) with δ = ν the last integrand is O ( x − 1 − ν ) , so that the last integral converges to a finite limit. Hence
p 00 ( t ) = ( ν L ∞ t ) − Λ ∞ / ν ( C + o ( 1 ) ) as t → ∞
for a constant C > 0 , and ∫ ∞ p 00 ( t ) d t diverges precisely when Λ ∞ / ν ≤ 1 . Since p 00 ( t ) → 0 as t → ∞ in either case, recurrence is null, and (ii) holds.
Let γ < 0 . Then | γ | = − γ > 0 and the integrand of (53) is at least 1 2 Λ ∞ x | γ | − 1 for all large x, so that
ln p 00 ( t ) ≤ − ( Λ ∞ / ( 3 | γ | ) ) τ | γ | ( t )
eventually. As τ | γ | ( t ) is of exact order t | γ | / ν with | γ | / ν > 0 , the function p 00 ( t ) decays at a stretched exponential rate and is integrable, so (iii) holds. □
Remark 6. 
Part (iii) and the positive recurrence in part (i) recover the dichotomy of [18,25], itself the reading of (52) under the hypotheses [ f ν ] and [ h δ ] ; part (ii) is new and closes the boundary that the sign criterion leaves open. In [17] that stratum was set aside on the ground that γ = 0 forces h ( s ) = f ′ ( s ) and hence a different model, the Markov Q-process. The implication does not hold: γ = 0 says only that δ = ν , and it leaves Λ ∞ free, which is precisely why the stratum splits. It also reduces to the classical statement. Indeed, in the finite variance case ν = δ = 1 with L ( x ) → L ∞ and ℓ ( x ) → h ′ ( 1 − ) as x → ∞ we have γ = 0 and Λ ∞ = h ′ ( 1 − ) / L ∞ = λ , where λ is exactly the parameter of Sevastyanov [35] and Pakes [30], and the threshold Λ ∞ ≤ ν becomes λ ≤ 1 . Thus the classical criterion is the section of the boundary stratum at ν = 1 . Note also that the trichotomy is genuinely two-dimensional: on the boundary γ = 0 the sign of γ carries no information at all and the whole of the classification is done by Λ ∞ .

6. The Transient Regime γ < 0

Throughout this section γ < 0 , so that | γ | = ν − δ lies in ( 0 , ν ) , and we assume χ = 2 δ − ν > 0 . By Theorem 6 the state space is transient and the transition functions decay at a stretched exponential rate. The correct normalisation is
Θ ( t ) : = Λ ∞ | γ | [ τ ( t ) ] | γ | ,
and we introduce the three quantities
K ( s ) : = ∫ 1 / ( 1 − s ) ∞ Λ ∞ − Λ ( u ) u 1 − | γ | d u and J ( t ; s ) : = ∫ τ ( t ; s ) ∞ Λ ∞ − Λ ( u ) u 1 − | γ | d u
and
D ( t ; s ) : = Λ ∞ | γ | ( [ τ ( t ) ] | γ | − [ τ ( t ; s ) ] | γ | ) .
Both integrals in (56) converge. Indeed, by (15) the integrand is
Λ ∞ [ c ℓ / δ ] u − 1 − χ + O ( u − 1 − δ ) + o ( u − 1 − χ ) ,
because δ − | γ | = χ and ν − | γ | = δ ; it is therefore O ( u − 1 − χ ) as u → ∞ , and χ > 0 suffices for convergence; and when c ℓ > 0 the integrand is of exactly that order, so that χ > 0 is then also necessary. This is where the hypothesis χ > 0 enters, and, as long as c ℓ > 0 , it is the only place.
The hypotheses ( A ) and ( B ) are needed already in the identity below, since Λ ∞ enters the definitions (55)–(57) and the convergence of the two integrals (56) was read off from (15).
Lemma 8. 
Let the Basic Axioms hold with γ < 0 and χ > 0 . Then for every s ∈ [ 0 , 1 ) and t ∈ T
e Θ ( t ) P ( t ; s ) = U ( s ) exp { D ( t ; s ) − J ( t ; s ) } ,
where
U ( s ) : = exp { Λ ∞ | γ | 1 ( 1 − s ) | γ | + K ( s ) } .
Proof. 
Split the integrand of (51), in which 1 + γ = 1 − | γ | , into Λ ∞ u | γ | − 1 and
− [ Λ ∞ − Λ ( u ) ] u | γ | − 1 .
The first part integrates to
( Λ ∞ / | γ | ) [ τ | γ | ( t ; s ) − ( 1 − s ) − | γ | ]
and the second to J ( t ; s ) − K ( s ) . Adding Θ ( t ) and using (57) gives (58). □
Identity (58) is exact. The theorem below merely evaluates the two terms in its exponent. Note that (58) requires no relation between Λ ∞ and | γ | . The formulation of [17], which normalises by exp { τ | γ | ( t ) } instead of by e Θ ( t ) , is the special case Λ ∞ = | γ | of (55). Under that same hypothesis [16, Thm. 2.2] bounds the relative deviation by O ( ℓ ( τ ( t ) ) τ − χ ( t ) ) as t → ∞ ; what Theorem 7 below adds is the constant in front of that order, the freedom in Λ ∞ , and the uniformity in s.
Theorem 7. 
Let the Basic Axioms hold with γ < 0 , χ > 0 and c ℓ > 0 . Then, uniformly in s ∈ [ 0 , d ] for every d < 1 ,
e Θ ( t ) P ( t ; s ) = U ( s ) ( 1 − ζ ( t ; s ) ) for every t ∈ T ,
where the relative deviation ζ ( t ; s ) tends to zero as t → ∞ , is free of s to leading order, and equals
ζ ( t ; s ) = Λ ∞ c ℓ δ χ 1 ( ν L ∞ t ) χ / ν ( 1 + o ( 1 ) ) as t → ∞ .
If in addition ( A * ) and ( B * ) hold, then the o ( 1 ) of (61) is exact:
ζ ( t ; s ) = Λ ∞ c ℓ δ χ 1 ( ν L ∞ t ) χ / ν ( 1 + O ( t − ρ 1 / ν ) ) as t → ∞ ,
where ρ 1 : = min { ρ * , | γ | , χ } and ρ * is the rate (6). The coefficients of the power series expansion U ( s ) = ∑ j ∈ E u j s j are nonnegative and generate an invariant measure for the transition functions, that is,
u j = ∑ i ∈ E u i p i j ( t ) for all j ∈ E , t ∈ T .
Proof. 
We evaluate the two terms in the exponent of (58).
By (15) and δ − | γ | = χ , ν − | γ | = δ , the integrand of J ( t ; s ) equals
Λ ∞ [ c ℓ / δ ] u − 1 − χ − Λ ∞ [ c L / ν ] u − 1 − δ + o ( u − 1 − χ ) ,
so that
J ( t ; s ) = Λ ∞ c ℓ δ χ 1 τ χ ( t ; s ) ( 1 + o ( 1 ) ) as t → ∞ ,
the second contribution being of the smaller order τ − δ ( t ; s ) because χ < δ is equivalent to δ < ν . Here c ℓ > 0 is used. By Theorem 2 and the uniform two-sided bound (26) we may replace τ ( t ; s ) in (64) by ( ν L ∞ t ) 1 / ν , which gives (61).
Under ( A * ) and ( B * ) the same computation is carried out with (16) in place of (15). Since δ − | γ | = χ and min { ν , δ } − | γ | = χ for γ < 0 , the integrand of J ( t ; s ) becomes
Λ ∞ [ c ℓ / δ ] u − 1 − χ − Λ ∞ [ c L / ν ] u − 1 − δ + O ( u − 1 − χ − ρ * ) ,
and integration from τ ( t ; s ) to infinity gives
J ( t ; s ) = Λ ∞ c ℓ δ χ 1 τ χ ( t ; s ) ( 1 + O ( τ − ρ 1 ( t ; s ) ) ) as t → ∞ ,
because the second term is of relative order τ − ( δ − χ ) ( t ; s ) = τ − | γ | ( t ; s ) . The passage to ( ν L ∞ t ) χ / ν costs a relative O ( ln t / t ) by (29) and a relative O ( 1 / t ) , uniform on [ 0 , d ] , by the consequence (34) of Lemma 5; both are of smaller order than t − ρ 1 / ν , since ρ 1 ≤ | γ | < ν . This gives (62).
For D ( t ; s ) we use Lemma 5. By (34),
[ τ ( t ; s ) ] | γ | − [ τ ( t ) ] | γ | = | γ | L ∞ M ( s ) [ τ ( t ) ] | γ | − ν ( 1 + o ( 1 ) )
and therefore, by | γ | − ν = − δ and (57),
D ( t ; s ) = − Λ ∞ L ∞ M ( s ) ( ν L ∞ t ) δ / ν ( 1 + o ( 1 ) ) as t → ∞ .
Since χ < δ , the quantity D ( t ; s ) is of smaller order than J ( t ; s ) uniformly on [ 0 , d ] , and (58) gives
ζ ( t ; s ) = 1 − exp { D ( t ; s ) − J ( t ; s ) } ,
whence (60) and, at leading order, (61). Three quantities are of smaller order than that leading term and together make up the remainder of (62). By (66) the relative size of D ( t ; s ) is O ( t − | γ | / ν ) , since δ − χ = | γ | . The relative error of J ( t ; s ) itself is O ( t − min { ρ * , | γ | } / ν ) by (65). And the quadratic term of 1 − e − x = x − x 2 / 2 + O ( x 3 ) as x → 0 contributes a relative O ( J ( t ; s ) ) = O ( t − χ / ν ) ; this is why χ stands in ρ 1 and cannot be dropped from it, and it is also the term that the first-order statement (61) absorbs in its o ( 1 ) . Of these only the contribution of D ( t ; s ) depends on s, through M ( s ) , and it is of the exact relative order t − | γ | / ν ; the relative deviation therefore depends on s only through terms of relative order t − | γ | / ν and smaller. When ρ 1 = | γ | , as for Model T of Section 10, this dependence sits at the order of the remainder in (62) itself, and Figure 1 displays it.
It remains to prove (63). The branching property and the Kolmogorov–Chapman equation give F ( t + u ; s ) = F ( u ; F ( t ; s ) ) and hence, from (1),
P ( t + u ; s ) = P ( t ; s ) P ( u ; F ( t ; s ) ) .
Now Θ ( t + u ) − Θ ( u ) → 0 as u → ∞ for each fixed t ∈ T . Indeed, the same semigroup relation at s = 0 gives τ ( t + u ) = τ ( u ; F ( t ; 0 ) ) , so that by (57) one has Θ ( t + u ) − Θ ( u ) = − D ( u ; F ( t ; 0 ) ) , and this tends to zero by (66) read at the fixed argument F ( t ; 0 ) < 1 . Multiplying the last identity by e Θ ( u ) and letting u → ∞ therefore yields
P ( t ; s ) = U ( s ) U ( F ( t ; s ) ) .
That U ( * ) is analytic on the whole unit disc, and not merely on [ 0 , 1 ) , is a matter of calculus and not of the limit theorem: the substitution of Lemma 7 carries the exponent of (59) into − ∫ 0 s [ h ( y ) / f ( y ) ] d y , up to the additive constant ln u 0 of (70) below, and 1 / f ( * ) is analytic on the disc by Lemma 9 below, whose proof uses nothing from the present section, so that the forward reference is not circular. Expanding the denominator of (67) as
U ( F ( t ; s ) ) = ∑ i ∈ E u i [ F ( t ; s ) ] i
and invoking (1) once more, the double series below being absolutely convergent because ∑ i | u i | ϱ i < ∞ for every ϱ < 1 , while F ( t ; s ) ≤ F ( t ; d ) < 1 for s ∈ [ 0 , d ] ,
∑ j ∈ E u j s j = U ( s ) = ∑ i ∈ E u i [ F ( t ; s ) ] i P ( t ; s ) = ∑ i ∈ E u i P i ( t ; s ) = ∑ j ∈ E [ ∑ i ∈ E u i p i j ( t ) ] s j ,
and comparison of the coefficients gives (63). That the u j are nonnegative is not read off from (59), whose exponent has no sign; it follows from U = u 0 r of Theorem 9, the coefficients of r ( * ) being limits of the nonnegative ratios p 0 j ( t ) / p 00 ( t ) . □
Remark 7. 
The hypothesis c ℓ > 0 in Theorem 7 is not cosmetic, and what replaces (61) without it is the following. Let the Basic Axioms hold with γ < 0 and χ > 0 , let c ℓ = 0 , and let ( B * ) hold with ρ ℓ > | γ | . Then, uniformly in s ∈ [ 0 , d ] for every d < 1 ,
ζ ( t ; s ) = Λ ∞ [ τ ( t ) ] δ [ L ∞ M ( s ) − c L ν δ ] + o ( τ − δ ( t ) ) as t → ∞ ,
the remainder being additive because the bracket vanishes at the value of s where the sign turns. Indeed, at c ℓ = 0 hypothesis ( B * ) gives ℓ ∞ − ℓ ( x ) = O ( x − δ − ρ ℓ ) , which is o ( x − ν ) because ρ ℓ > | γ | = ν − δ , so that with (8) the relation (15) sharpens to
Λ ∞ − Λ ( x ) = − Λ ∞ c L ν x ν + o ( x − ν ) as x → ∞ .
The term of order u − 1 − χ in the integrand of J ( t ; s ) therefore disappears and only the second one survives, and the computation behind (64) leaves
J ( t ; s ) = − Λ ∞ c L ν δ 1 [ τ ( t ; s ) ] δ + o ( τ − δ ( t ; s ) ) as t → ∞ .
Without the quantitative hypothesis the remainder o ( x − δ ) of (15) would, after division by x 1 − | γ | , be of the larger order o ( x − 1 − χ ) and would swamp the surviving term. By (66) this is of the same order as D ( t ; s ) itself rather than of a larger one. The two therefore compete, and subtracting (69) from (66) in ζ ( t ; s ) = 1 − exp { D ( t ; s ) − J ( t ; s ) } gives (68), the replacement of τ ( t ; s ) by τ ( t ) costing O ( τ − δ ( t ) / t ) uniformly on [ 0 , d ] by (34). What is lost at c ℓ = 0 is thus the conclusion of Theorem 7 that the leading term is free of s: the deviation is then governed by M ( * ) , and its sign turns with s, the approach being from above while M ( s ) < c L / ( ν δ L ∞ ) and from below beyond that value. The limit (60) and the identity (58) behind it are untouched.
At s = 0 the term D ( t ; s ) vanishes identically, so (58) becomes an exact formula for the return probability.
Theorem 8. 
Under the hypotheses of Lemma 8, for every t ∈ T
e Θ ( t ) p 00 ( t ) = u 0 exp { − J 0 ( t ) } , where u 0 = exp { Λ ∞ | γ | + K 0 }
with K 0 : = K ( 0 ) and J 0 ( t ) : = J ( t ; 0 ) . If moreover c ℓ > 0 , then
J 0 ( t ) = Λ ∞ c ℓ δ χ 1 ( ν L ∞ t ) χ / ν ( 1 + o ( 1 ) ) as t → ∞ ,
the o ( 1 ) being O ( t − ρ 1 / ν ) with ρ 1 of (62) under ( A * ) and ( B * ) .
Proof. 
Put s = 0 in (58); then τ ( t ; 0 ) = τ ( t ) , so D ( t ; 0 ) = 0 and U ( 0 ) = u 0 . Both forms of (71) are (64) and (65) read at s = 0 . □
The invariant measure can also be obtained from the ratio limit property, and the two constructions agree.
Theorem 9. 
Under the hypotheses of Lemma 8 the limits
r j : = lim t → ∞ p 0 j ( t ) p 00 ( t )
exist, are finite and positive for every j ∈ E , and their generating function is
r ( s ) = ∑ j ∈ E r j s j = exp { ∫ 1 1 / ( 1 − s ) Λ ( u ) u 1 − | γ | d u } .
Moreover U ( s ) = u 0 r ( s ) identically on [ 0 , 1 ) , so that the two invariant measures { u j } and { r j } coincide up to the factor u 0 ; and
r ( s ) = 1 u 0 exp { Λ ∞ | γ | 1 ( 1 − s ) | γ | } ( 1 + O ( ( 1 − s ) χ ) ) as s ↑ 1 .
Proof. 
By (51) the ratio r ( t ; s ) : = P ( t ; s ) / P ( t ; 0 ) satisfies
ln r ( t ; s ) = ∫ 1 1 / ( 1 − s ) Λ ( u ) u 1 − | γ | d u − ∫ τ ( t ) τ ( t ; s ) Λ ( u ) u 1 − | γ | d u .
The second integral tends to zero, because τ ( t ; s ) / τ ( t ) → 1 as t → ∞ while the integrand is regularly varying of index | γ | − 1 < 0 and
τ | γ | ( t ; s ) − τ | γ | ( t ) = O ( τ − δ ( t ) ) as t → ∞
by (66). This proves (72) for the generating functions; since the coefficients p 0 j ( t ) / p 00 ( t ) are nonnegative and the limit (72) is a power series with radius of convergence 1, the continuity theorem for generating functions gives the coefficientwise convergence p 0 j ( t ) / p 00 ( t ) → r j as t → ∞ .
For the identity U = u 0 r subtract the exponents. By (59) and (70),
ln U ( s ) u 0 = Λ ∞ | γ | [ 1 ( 1 − s ) | γ | − 1 ] + K ( s ) − K 0 = ∫ 1 1 / ( 1 − s ) Λ ( u ) u 1 − | γ | d u ,
because
Λ ∞ | γ | [ 1 ( 1 − s ) | γ | − 1 ] = ∫ 1 1 / ( 1 − s ) Λ ∞ u 1 − | γ | d u
and
K ( s ) − K 0 = − ∫ 1 1 / ( 1 − s ) Λ ∞ − Λ ( u ) u 1 − | γ | d u .
This is precisely ln r ( s ) . Strict positivity of the r j follows in three steps, none of which uses it. The limits r j are nonnegative, being limits of the ratios p 0 j ( t ) / p 00 ( t ) ; hence so are the coefficients u j = u 0 r j , with u 0 > 0 by (70); and the invariance (63), which is proved in Theorem 7 from the identity (67) alone, therefore gives u 0 r j = u j ≥ u 0 p 0 j ( t ) for any fixed positive t ∈ T , while p 0 j ( t ) > 0 for every j ∈ E because the chain is irreducible on E .
Finally, (73) follows from U = u 0 r and (59) on noting that K ( s ) = O ( ( 1 − s ) χ ) as s ↑ 1 , which is the tail estimate (64) read with 1 / ( 1 − s ) in place of τ ( t ; s ) , the two integrals of (56) having one and the same integrand. □

7. The Boundary Regime γ = 0

On the boundary δ = ν the exponent in (51) diverges logarithmically, and the normalisation is a power of τ ( t ) whose exponent is Λ ∞ . Put
G ( X ) : = ∫ X ∞ Λ ( u ) − Λ ∞ u d u .
The integral (74) converges absolutely by (15), the integrand being O ( u − 1 − ν ) when δ = ν .
Theorem 10. 
Let the Basic Axioms hold with γ = 0 . Then, uniformly in s ∈ [ 0 , d ] for every d < 1 ,
[ τ ( t ) ] Λ ∞ P ( t ; s ) = U 0 ( s ) { 1 − Λ ∞ ν t [ M ( s ) + c ℓ − c L ν 2 L ∞ ] + o ( 1 / t ) } as t → ∞ ,
and, if in addition ( A * ) and ( B * ) hold, the o ( 1 / t ) of (75) is
O ( ln t t 1 + ρ * / ν ) as t → ∞ ,
uniformly in s ∈ [ 0 , d ] , with ρ * of (6). The limiting generating function is
U 0 ( s ) : = 1 ( 1 − s ) Λ ∞ exp { − G ( 1 1 − s ) } .
The coefficients of its power series expansion are nonnegative and generate an invariant measure for the transition functions. In particular, with λ : = Λ ∞ / ν ,
( ν L ∞ t ) λ P ( t ; s ) ⟶ U 0 ( s ) as t → ∞ .
Proof. 
Set γ = 0 in (51) and split the integrand as before:
ln P ( t ; s ) = − Λ ∞ ln [ ( 1 − s ) τ ( t ; s ) ] − G ( 1 1 − s ) + G ( τ ( t ; s ) ) ,
whence, by (77),
ln [ τ ( t ) ] Λ ∞ P ( t ; s ) U 0 ( s ) = − Λ ∞ ln τ ( t ; s ) τ ( t ) + G ( τ ( t ; s ) ) .
Both terms are of order 1 / t and both are computed from the identities already established: the first of them is (35) of Lemma 5. For the second term of (79) insert (15) with δ = ν , which reads
Λ ( u ) − Λ ∞ = − Λ ∞ [ c ℓ − c L ] ν u ν + o ( u − ν ) ,
and integrate:
G ( τ ( t ; s ) ) = − Λ ∞ [ c ℓ − c L ] ν 2 τ ν ( t ; s ) + o ( τ − ν ( t ; s ) ) = − Λ ∞ [ c ℓ − c L ] ν 3 L ∞ t + o ( 1 / t ) .
Adding the two contributions and exponentiating gives (75).
Under ( A * ) and ( B * ) both o ( 1 ) above become explicit, and (76) follows. In the first contribution (29) gives that 1 / τ ν ( t ) equals 1 / ( ν L ∞ t ) up to a relative O ( ln t / t ) ; in the second, (16) with δ = ν replaces the factor 1 + o ( 1 ) in the integrand of G ( * ) by 1 + O ( u − ρ * ) , and integration turns this into a relative O ( τ − ρ * ( t ; s ) ) , that is O ( t − ρ * / ν ) , uniformly on [ 0 , d ] . The quadratic term of the exponential contributes O ( 1 / t 2 ) , which is covered because ρ * ≤ ν . Finally (78) follows from (28). The invariance of the coefficients of U 0 ( s ) is proved exactly as (63), the only point to check being that Λ ∞ ln [ τ ( t + u ) / τ ( u ) ] → 0 as u → ∞ for fixed t ∈ T , which is immediate from (28). Their nonnegativity follows, as the nonnegativity of the u j followed in the transient regime from Theorem 9, on dividing (78) at s by the same relation at s = 0 : this gives U 0 ( s ) = U 0 ( 0 ) r ( s ) with r ( * ) of (96), whose coefficients are limits of the nonnegative ratios p 0 j ( t ) / p 00 ( t ) by Theorem 13. That theorem rests on Lemmas 10 and 11 and on Theorems 2 and 5 alone, so it uses nothing from the present section and the forward reference is not circular. □
Remark 8. 
Formula (78) is the exact analogue, on the whole boundary stratum, of the classical statement that t λ P ( t ; s ) converges. At ν = δ = 1 , L ( x ) ≡ a 0 , ℓ ( x ) ≡ h ′ ( 1 − ) one has λ = h ′ ( 1 − ) / a 0 , c L = c ℓ = 0 , G ( X ) ≡ 0 and U 0 ( s ) = ( 1 − s ) − λ , and (78) reduces to ( a 0 t ) λ P ( t ; s ) → ( 1 − s ) − λ as t → ∞ , in agreement with [30,35]. The novelty for ν < 1 is that the normalisation is t Λ ∞ / ν rather than t Λ ∞ , and that the limit acquires the correction factor exp { − G } generated by the joint remainder of the two slowly varying functions. Note also that (75) is a rate of convergence on the boundary, and that the rate is 1 / t irrespective of the position of Λ ∞ relative to the threshold ν: the classification of Theorem 6 concerns the size of the limit, not the speed at which it is approached.

8. The Positive Recurrent Regime γ > 0

For γ > 0 the exponent in (51) converges and no normalisation is needed at all: the transition functions converge to a proper stationary distribution. Put
W ( X ) : = ∫ X ∞ Λ ( u ) u 1 + γ d u ,
which is finite for every X ≥ 1 and satisfies
W ( X ) = Λ ∞ γ 1 X γ ( 1 + o ( 1 ) ) as X → ∞ ,
because Λ ( u ) → Λ ∞ as u → ∞ by (13).
Neither the limit in this regime nor the constant in front of the rate is new; the two sources are named in Section 1. The limit is the stationary generating function π ( s ) of Theorem 11 below, written in those sources in the equivalent form exp { ∫ s 1 [ h ( u ) / f ( u ) ] d u } , and the relative deviation is given there as
ℓ ( τ ( t ) ) γ L δ / ν ( τ ( t ) ) [ ν t + 1 / V ( 1 − s ) ] γ / ν ,
which under the present hypotheses is exactly the leading term of the rate obtained in that theorem: the two slowly varying factors converge, and ℓ ∞ / ( γ L ∞ δ / ν ) = Λ ∞ / ( γ L ∞ γ / ν ) because δ / ν = 1 + γ / ν . What the theorem below adds is that those factors are replaced by the constants they converge to, so that the rate is a power of t with a numerical coefficient; that the approach is monotone; that it is uniform in s on the whole of [ 0 , 1 ) when the rate is expressed through τ ( t ; s ) ; and, through Section 9, the same rate for the individual transition probabilities. In those two sources the passage from the generating function to the coefficients is made by the continuity theorem for power series, which yields the convergence of the coefficients but not a rate for them; supplying the rate is the object of Section 9.
Theorem 11. 
Let the Basic Axioms hold with γ > 0 . Then the stationary distribution { π j , j ∈ E } of the MBIS exists, its generating function is
π ( s ) = ∑ j ∈ E π j s j = exp { − W ( 1 1 − s ) } ,
and the approach to it is monotone with the exact rate
P ( t ; s ) = π ( s ) { 1 + Λ ∞ γ 1 [ τ ( t ; s ) ] γ ( 1 + o ( 1 ) ) } as t → ∞ ,
uniformly in s ∈ [ 0 , 1 ) . In terms of t alone,
P ( t ; s ) = π ( s ) { 1 + Λ ∞ γ 1 ( ν L ∞ t ) γ / ν ( 1 + o ( 1 ) ) } as t → ∞ ,
uniformly in s ∈ [ 0 , d ] for every d < 1 ; on the whole of [ 0 , 1 ) the factor 1 + o ( 1 ) in (84) must be replaced by a bounded one.
Proof. 
By (51) and (80),
ln P ( t ; s ) = − W ( 1 1 − s ) + W ( τ ( t ; s ) ) ,
an exact identity. Since (85) makes P ( t ; s ) a function of τ ( t ; s ) alone, and since τ ( t ; s ) ↑ ∞ as t → ∞ and W ( * ) is positive and decreasing, P ( t ; s ) decreases to π ( s ) given by (82). The function π ( * ) is a power series with nonnegative coefficients, and π ( 1 − ) = 1 because W ( X ) → 0 as X → ∞ ; so it is the generating function of a proper probability distribution on E , which by Theorem 6(i) is the stationary distribution. For the rate use (81) at X = τ ( t ; s ) together with e x = 1 + x + O ( x 2 ) as x → 0 ; since τ ( t ; s ) ≥ τ ( t ) → ∞ as t → ∞ uniformly in s ∈ [ 0 , 1 ) by Theorem 2, both relations hold uniformly there, and (83) follows.
Replacing τ ( t ; s ) by ( ν L ∞ t ) 1 / ν requires τ ( t ; s ) / τ ( t ) → 1 as t → ∞ , which by (34) holds uniformly on [ 0 , d ] for every d < 1 but not on [ 0 , 1 ) : along any s = s ( t ) ↑ 1 with M ( s ( t ) ) / t → 1 one has τ ( t ; s ) / τ ( t ) → 2 1 / ν , and the constant of (84) acquires the factor 1 / 2 γ / ν . This proves (84) on [ 0 , d ] ; the bounded form of (84) holds on the whole of [ 0 , 1 ) because W ( τ ( t ; s ) ) ≤ W ( τ ( t ) ) there. □
Remark 9. 
The three regimes fit together as they should. Comparing (59), (77) and (82) one sees that in every case the limiting generating function comes from the same exponent − ∫ 1 / ( 1 − s ) ∞ Λ ( u ) u − 1 − γ d u of (51), the constant part Λ ∞ of Λ ( * ) being split off and integrated separately whenever γ ≤ 0 , which is exactly when it makes the integral diverge. The rate of convergence is in each case governed by the tail of the same integral: it is τ − χ ( t ) for γ < 0 , τ − ν ( t ) for γ = 0 and τ − γ ( t ) for γ > 0 . Only the transient regime requires a condition beyond the Basic Axioms, namely χ > 0 , and only there does the normalising factor grow.

9. From the Generating Functions to the Transition Probabilities

Every rate established so far is a rate for a generating function on a real interval. Passing from it to a rate for the individual transition probabilities is not automatic. The coefficients of the difference of two power series with nonnegative coefficients have no sign, so a bound on that difference along [ 0 , d ] carries no information about them one at a time. The customary remedy is to assume that the ratios converge monotonically in t, which makes those coefficients nonnegative and the transfer elementary. We do not assume it. The systematic device for passing from the behaviour of a generating function near its singularity to the asymptotics of its coefficients is the singularity analysis of Flajolet and Odlyzko [9], but it requires an analytic continuation beyond the disc of convergence, which is not available here. What is needed instead is the same bound for complex s on the circle | s | = d , and criticality supplies it through the factorisation recorded next.
The passage from the real interval to the disc costs no new hypothesis. The functions that are carried across it are power series with nonnegative coefficients, analytic on | s | < 1 as recorded in Section 2; an identity between two of them proved for real s ∈ [ 0 , 1 ) therefore holds throughout | s | < 1 by the identity theorem, and we say so at each of the two places below where that extension is used. Objects defined by an integral along the real axis, such as K ( s ) of (56) or W ( * ) of (80), are not carried across and continue to occur with a real argument only. The regular variation hypotheses [ f ν ] and [ h δ ] , for their part, are, and remain, statements about a real argument: they are never evaluated off the real axis, and they enter the complex estimates below only through (88), which is read on the real segment z = 1 − y with y ∈ ( 0 , 1 ] . Off that segment the power series structure alone is used.
Lemma 9. 
Let the system be critical. Then, with σ i ( z ) : = 1 + z + … + z i − 1 ,
f ( z ) = ( 1 − z ) 2 Ω ( z ) and h ( z ) = − ( 1 − z ) H ( z ) ,
where
Ω ( z ) : = ∑ k ≥ 2 a k ∑ i = 1 k − 1 σ i ( z ) and H ( z ) : = ∑ k ∈ N b k σ k ( z )
are power series with nonnegative coefficients, convergent for | z | < 1 . Moreover f ( z ) ≠ 0 and Ω ( z ) ≠ 0 throughout | z | < 1 , and for real y ∈ ( 0 , 1 ]
Ω ( 1 − y ) = L ( 1 / y ) y 1 − ν and H ( 1 − y ) = ℓ ( 1 / y ) y 1 − δ .
Consequently M ( s ) = ∫ 0 s [ 1 / f ( x ) ] d x is single-valued and analytic on | s | < 1 , and for each d < 1
c d : = min | z | ≤ d | f ( z ) | > 0 .
Proof. 
Criticality means f ( 1 ) = ∑ k a k = 0 and f ′ ( 1 − ) = ∑ k k a k = 0 . From the first,
f ( z ) = ∑ k a k ( z k − 1 ) = − ( 1 − z ) ∑ k ∈ N a k σ k ( z ) ,
so that
f ( z ) 1 − z = − a 1 − ∑ k ≥ 2 a k σ k ( z ) .
From the second, − a 1 = ∑ k ≥ 2 k a k = ∑ k ≥ 2 a k σ k ( 1 ) , whence
f ( z ) 1 − z = ∑ k ≥ 2 a k [ σ k ( 1 ) − σ k ( z ) ] .
Since
σ k ( 1 ) − σ k ( z ) = ∑ i = 1 k − 1 ( 1 − z i ) = ( 1 − z ) ∑ i = 1 k − 1 σ i ( z ) ,
the first half of (86) follows with Ω ( * ) as in (87); all its coefficients are nonnegative because a k ≥ 0 for k ≥ 2 . The statement for h ( * ) is the same computation with ∑ k b k = 0 , and there the first step already suffices.
For the zeros, let | z | < 1 . Then
| σ k ( z ) | ≤ σ k ( | z | ) < σ k ( 1 )
for every k ≥ 2 , so that
| ∑ k ≥ 2 a k σ k ( z ) | ≤ ∑ k ≥ 2 a k σ k ( | z | ) < ∑ k ≥ 2 a k σ k ( 1 ) = − a 1 ,
the strict inequality holding because a k > 0 for at least one k ≥ 2 , which the consistency condition a 0 < − a 1 forces since ∑ k ≥ 2 a k = − a 1 − a 0 > 0 . Hence f ( z ) / ( 1 − z ) = − a 1 − ∑ k ≥ 2 a k σ k ( z ) is nonzero, and so are f ( z ) and Ω ( z ) = f ( z ) / ( 1 − z ) 2 . Identities (88) are [ f ν ] and [ h δ ] divided by y 2 and by y respectively. The disc is simply connected and 1 / f ( z ) is analytic on it, so M ( s ) is single-valued and analytic; and (89) holds because | f | is continuous and positive on the compact disc | z | ≤ d . □
What is needed besides is that, on | s | ≤ d , the function F ( t ; s ) stays within a distance of order q ( t ) / t of its value at s = 0 . This is what makes all the complex estimates below cheap. Here and in the rest of this section C d denotes a finite positive constant depending on d alone, not necessarily the same at each occurrence.
Lemma 10. 
Let [ f ν ] , [ h δ ] and ( A ) hold, and fix d < 1 . Then, as t → ∞ , uniformly in | s | ≤ d ,
| F ( t ; s ) − F ( t ; 0 ) | = O ( q ( t ) t ) and 1 − F ( t ; s ) q ( t ) = 1 + O ( 1 / t )
and
f ( F ( t ; s ) ) f ( F ( t ; 0 ) ) = 1 + O ( 1 / t ) .
Moreover, for all sufficiently large t and every u on the segment joining F ( t ; 0 ) to F ( t ; s ) ,
| h ( u ) f ( u ) | ≤ C Λ ( τ ( t ) ) q γ − 1 ( t )
with a constant C depending on ν and δ only; the threshold beyond which (92) holds depends on d, the constant C does not. Hypothesis [ h δ ] is used for (92) alone; (90) and (91) need the other two only.
Proof. 
Since F ( t ; s ) − F ( t ; 0 ) = ∑ j ∈ S p j ( t ) s j has nonnegative coefficients,
| F ( t ; s ) − F ( t ; 0 ) | ≤ ∑ j ∈ S p j ( t ) d j = p 1 ( t ) V ( t ; d ) ,
and V ( t ; d ) → a 0 M ( d ) < ∞ by Theorem 5. By (38) and (42), p 1 ( t ) / q ( t ) = 1 / ( a 0 A ( t ) ) with A ( t ) = ν t ( 1 + o ( 1 ) ) as t → ∞ , which gives the first half of (90); the second half follows from 1 − F ( t ; s ) = q ( t ) − [ F ( t ; s ) − F ( t ; 0 ) ] .
Write z : = F ( t ; s ) and z 0 : = F ( t ; 0 ) = 1 − q ( t ) , so that | z − z 0 | ≤ C d q ( t ) / t by (90). By (86),
f ( z ) f ( z 0 ) = ( 1 − z 1 − z 0 ) 2 Ω ( z ) Ω ( z 0 ) ,
and the first factor is 1 + O ( 1 / t ) by (90). For the second put ϱ : = q ( t ) / 2 and note that | ϖ | ≤ 1 − ϱ whenever | ϖ − z 0 | ≤ ϱ , so that | Ω ( ϖ ) | ≤ Ω ( 1 − ϱ ) there, the coefficients of Ω ( * ) being nonnegative. Cauchy’s estimate on that disc gives | Ω ′ ( ϖ ) | ≤ 2 Ω ( 1 − ϱ ) / ϱ for | ϖ − z 0 | ≤ ϱ / 2 , whence
| Ω ( z ) Ω ( z 0 ) − 1 | ≤ 4 | z − z 0 | q ( t ) Ω ( 1 − q ( t ) / 2 ) Ω ( 1 − q ( t ) ) .
By (88) the last ratio equals
2 1 − ν L ( 2 τ ( t ) ) L ( τ ( t ) ) ⟶ 2 1 − ν as t → ∞ ,
and | z − z 0 | / q ( t ) is O ( 1 / t ) . This proves (91).
Finally, on the segment in question u satisfies | u − z 0 | ≤ C d q ( t ) / t , so that for all large t it lies in the disc | ϖ − z 0 | ≤ ϱ / 2 and the bound just proved for Ω ( z ) / Ω ( z 0 ) applies verbatim with u in place of z; hence
| Ω ( u ) | ≥ 1 2 Ω ( 1 − q ( t ) ) .
A lower bound of this kind is what is needed here, and it does not follow from the nonnegativity of the coefficients of Ω ( * ) , which gives upper bounds only. Together with | 1 − u | ≥ q ( t ) / 2 and, the coefficients of H ( * ) being nonnegative, | H ( u ) | ≤ H ( 1 − q ( t ) / 2 ) , we obtain from (86) and (88)
| h ( u ) f ( u ) | = | H ( u ) | | 1 − u | | Ω ( u ) | ≤ 4 H ( 1 − q ( t ) / 2 ) q ( t ) Ω ( 1 − q ( t ) ) ≤ C ℓ ( τ ( t ) ) q δ − 1 ( t ) q ( t ) L ( τ ( t ) ) q ν − 1 ( t ) ,
the last step using ℓ ( 2 τ ( t ) ) / ℓ ( τ ( t ) ) → 1 as t → ∞ , which is (92) because γ = δ − ν . □
We can now transfer the rate of Theorem 5 to the individual local probabilities of the branching system without immigration, which is what legitimises the passage to the coefficients in (50).
Theorem 12. 
Let [ f ν ] and ( A ) hold and let d < 1 . Then there is a constant C d < ∞ such that
| p j ( t ) p 1 ( t ) − a 0 m j | ≤ C d d j t for all j ∈ S
and all sufficiently large t.
Proof. 
The relation ∂ F ( t ; s ) / ∂ s = f ( F ( t ; s ) ) / f ( s ) obtained in Lemma 6 holds for real s ∈ [ 0 , 1 ) ; both sides are analytic in | s | < 1 , by Lemma 9 for the denominator, so the identity theorem extends it to the whole disc. The same applies to M ′ ( s ) = 1 / f ( s ) . Integrating both along the segment from 0 to s and using a 0 p 1 ( t ) = f ( F ( t ; 0 ) ) from (38), we obtain for every | s | < 1 the exact identity
V ( t ; s ) − a 0 M ( s ) = a 0 ∫ 0 s 1 f ( x ) [ f ( F ( t ; x ) ) f ( F ( t ; 0 ) ) − 1 ] d x .
By (91) the bracket in (94) is O ( 1 / t ) uniformly for | x | ≤ d , and | f ( x ) | ≥ c d > 0 there by (89); since the segment has length at most d,
sup | s | ≤ d | V ( t ; s ) − a 0 M ( s ) | ≤ C d t as t → ∞ .
Both V ( t ; * ) and a 0 M ( * ) are analytic on the disc, so Cauchy’s coefficient formula on the circle | s | = d turns (95) into (93). □
For the system with immigration the corresponding statement is uniform across the three regimes, because the ratio r ( t ; s ) = P ( t ; s ) / p 00 ( t ) of the proof of Theorem 9 obeys an exact identity in which the sign of γ plays no part. The generating function r ( s ) of (72) has, by the substitution of Lemma 7, the form
r ( s ) = exp { − ∫ 0 s h ( y ) f ( y ) d y } for s ∈ [ 0 , 1 ) ,
in which γ no longer appears; we use (96) for r ( s ) in all three regimes, and for γ > 0 it equals π ( s ) / π ( 0 ) with π ( * ) as in (82).
Lemma 11. 
Let [ f ν ] and [ h δ ] hold. Then for every | s | < 1 and t ∈ T
r ( t ; s ) r ( s ) = exp { ∫ F ( t ; 0 ) F ( t ; s ) h ( u ) f ( u ) d u } .
Proof. 
The substitution used in Lemma 7 gives
ln P ( t ; s ) = ∫ s F ( t ; s ) [ h ( u ) / f ( u ) ] d u ,
first for real s and then, both sides being analytic, for | s | < 1 . Subtracting the same identity at s = 0 and adding ∫ 0 s [ h ( u ) / f ( u ) ] d u to both sides gives (97), all integrals being taken along segments inside the disc, where 1 / f ( u ) is analytic. □
Theorem 13. 
Let the Basic Axioms hold and let d < 1 . Then, uniformly in | s | ≤ d ,
r ( t ; s ) r ( s ) = 1 + O ( q γ ( t ) t ) = 1 + O ( 1 t 1 + γ / ν ) as t → ∞ ,
and consequently, with r ( s ) = ∑ j ∈ E r j s j , there is a constant C d < ∞ such that
| p 0 j ( t ) p 00 ( t ) − r j | ≤ C d d j t 1 + γ / ν for all j ∈ E
and all large t. In particular the strong ratio limit property holds in all three regimes of Theorem 6, with one and the same limiting generating function (96).
Proof. 
Combining (97) with (90) and (92), the exponent is bounded in modulus by
C d q ( t ) t Λ ( τ ( t ) ) q γ − 1 ( t ) = O ( q γ ( t ) t ) as t → ∞ ,
because Λ ( τ ( t ) ) → Λ ∞ as t → ∞ . Theorem 2 turns q γ ( t ) into ( ν L ∞ t ) − γ / ν up to a factor 1 + o ( 1 ) , which is (98). Since r ( * ) is bounded on | s | ≤ d by r ( d ) , the same bound holds for | r ( t ; s ) − r ( s ) | up to a constant, and Cauchy’s coefficient formula on | s | = d gives (99). □
The three limit theorems of Section 6, Section 7 and Section 8 now become statements about the transition probabilities themselves. In each case the diagonal entry is covered by the corresponding theorem at s = 0 , and (99) carries the result to the whole row.
Corollary 2. 
Let the Basic Axioms hold and let d < 1 . There is a constant C d < ∞ such that for all j ∈ E and all large t:
(i)
if γ < 0 , χ > 0 and c ℓ > 0 , then
| e Θ ( t ) p 0 j ( t ) − u j | ≤ C d d − j ( ν L ∞ t ) − χ / ν ,
where U ( s ) = ∑ j ∈ E u j s j is the generating function (59);
(ii)
if γ = 0 , then
| [ τ ( t ) ] Λ ∞ p 0 j ( t ) − u j 0 | ≤ C d d − j / t ,
where U 0 ( s ) = ∑ j ∈ E u j 0 s j is given by (77);
(iii)
if γ > 0 , then
| p 0 j ( t ) − π j | ≤ C d d − j ( ν L ∞ t ) − γ / ν ,
where π ( s ) = ∑ j ∈ E π j s j is the stationary generating function (82).
Proof. 
Write N ( t ) for the normalising factor of the regime under consideration and ξ j for the limit asserted for the row entries, so that
N ( t ) = e Θ ( t ) , [ τ ( t ) ] Λ ∞ , 1 and ξ j = u j , u j 0 , π j
in the cases (i), (ii) and (iii) respectively, so that in all three the assertion is a bound on | N ( t ) p 0 j ( t ) − ξ j | at the rate displayed. Multiplying and dividing by the diagonal entry,
N ( t ) p 0 j ( t ) = N ( t ) p 00 ( t ) · [ p 0 j ( t ) / p 00 ( t ) ] .
In each case ξ j = ξ 0 r j , because dividing the defining limit at s by the same limit at s = 0 leaves r ( s ) of (96), the normalising factor cancelling. Then
| N ( t ) p 0 j ( t ) − ξ j | ≤ r j | N ( t ) p 00 ( t ) − ξ 0 | + N ( t ) p 00 ( t ) | p 0 j ( t ) p 00 ( t ) − r j | .
In the first term r j ≤ r ( d ) d − j , and | N ( t ) p 00 ( t ) − ξ 0 | is estimated by Theorem 8 in case (i), by Theorem 10 at s = 0 in case (ii) and by Theorem 11 at s = 0 in case (iii), the three rates being t − χ / ν , t − 1 and t − γ / ν . In the second term N ( t ) p 00 ( t ) is bounded and the factor after it is estimated by (99), giving d − j t − 1 − γ / ν . In each of the three cases the first term dominates: in (i) because χ < δ and 1 + γ / ν = δ / ν , in (ii) because the two rates coincide, and in (iii) because γ / ν < 1 + γ / ν . □
Remark 10. 
Two features of (93) and (99) are worth recording. The factor d − j can be made as close to 1 as desired by taking d close to 1, at the cost of enlarging C d ; the bounds are therefore genuinely uniform on finite ranges of j and degrade only geometrically. And the ratio p 0 j ( t ) / p 00 ( t ) settles down faster than the normalised transition functions themselves do, as one expects, since the slowly decaying part of P ( t ; s ) is common to numerator and denominator and cancels; the gain, however, is not the same in the three regimes. It is the full factor 1 / t only when γ > 0 , where (99) gives t − 1 − γ / ν against the rate t − γ / ν of (102). When γ < 0 the normalised rate of (100) is t − χ / ν and (99) gives t − δ / ν , a gain of t − | γ | / ν only; and when γ = 0 the two rates, that of (101) and that of (99), are both 1 / t and there is no gain at all, which is why the proof of Corollary 2 has to say in case (ii) that the two rates coincide.

10. Numerical Illustrations

Every constant occurring above is computable, and this section verifies them on a family of models in which the two generating functions are given in closed form and the hypotheses can be checked by inspection. Fix ν , δ ∈ ( 0 , 1 ] , c , β > 0 and α , η ∈ ( 0 , 1 ) , and put
f ( s ) = c [ ( 1 − s ) 1 + ν − α ( 1 − s ) 1 + 2 ν ] and h ( s ) = − β [ ( 1 − s ) δ − η ( 1 − s ) 2 δ ] .
The pair (103) is of the form [ f ν ] and [ h δ ] with
L ( x ) = c [ 1 − α x ν ] and ℓ ( x ) = β [ 1 − η x δ ] ,
both of them normalised and slowly varying; the index functions of (104) are ε L ( x ) = c α ν x − ν / L ( x ) and ε ℓ ( x ) = β η δ x − δ / ℓ ( x ) . Hence ( A * ) and ( B * ) hold with ρ L = ν and ρ ℓ = δ , so that ρ * = min { ν , δ } in (6) and the second-order rates (62) and (76) are available for the family; the constants of the paper are
L ∞ = c , ℓ ∞ = β , c L = ν α , c ℓ = δ η , b e g i n e q u a t i o n 5 p t ] Λ ∞ = β c , ϑ = ν α c , a 0 = c ( 1 − α ) .
The list (105) is all that the theorems require. That (103) really are infinitesimal generating functions, that is, that a k ≥ 0 for k ≥ 2 , a 1 < 0 < a 0 and b k ≥ 0 for k ≥ 1 , b 0 < 0 , is verified directly from the binomial coefficients for each parameter set of Table 1.
The whole computation reduces to one ordinary differential equation. By the backward equation (2) the function τ ν ( t ; s ) = R − ν ( t ; s ) satisfies
d d t τ ν ( t ; s ) = ν L ( τ ( t ; s ) ) with τ ν ( 0 ; s ) = 1 ( 1 − s ) ν ,
which involves L ( * ) alone, the immigration entering only through the quadrature that follows. For the family (104) the right-hand side of (106) is c ν [ τ ν ( t ; s ) − α ] / τ ν ( t ; s ) , so that separation of the variables solves (106) in closed form and gives the implicit relation
τ ν ( t ; s ) + α ln [ τ ν ( t ; s ) − α ] = c ν t + 1 ( 1 − s ) ν + α ln [ 1 ( 1 − s ) ν − α ] ,
an equation of Lambert type which is inverted to any prescribed accuracy, and in the same way
M ( s ) = 1 c ν [ 1 ( 1 − s ) ν − 1 + α ln ( 1 − s ) − ν − α 1 − α ] .
No numerical integration of (106) is therefore needed anywhere below; all the tables and figures of this section were produced from (107), (108) and the exact formulae (51) and (97), on the four parameter sets of Table 1. The letter in the name of each model marks the regime of Theorem 6 that it illustrates: T stands for transient, B for the boundary γ = 0 , on which both the null recurrent and the transient outcome are shown, and R for positive recurrent. Model T is the one for which Λ ∞ ≠ | γ | , so that the earlier normalisation exp { τ | γ | ( t ) } does not apply to it at all, whereas (55) does.

10.1. The Survival Probability

The agreement in Table 2 is to nine significant figures by t = 10 5 and to every digit printed by t = 10 7 , which leaves no room for doubt about the constant c of (30). In the linearised form of (31), the deviation of q ( t ) from its leading term ( ν L ∞ t ) − 1 / ν , multiplied by ν 3 L ∞ t , follows the straight line c L ln ( ν L ∞ t ) − ν c in ln t from t ≈ 50 onward, and changes sign in the process, which no one-term approximation can reproduce.
For this family both constants of (29) are open to inspection. Indeed (107) at s = 0 reads
τ ν ( t ) = c ν t + 1 + α ln ( 1 − α ) − α ln [ τ ν ( t ) − α ] ,
an exact relation in which the coefficient of the logarithm is α = c L / ν and the additive constant is c = 1 + α ln ( 1 − α ) , that is 0.9280795 for Model T. The coefficient is thus c L / ν and not L ∞ / ν , which for this model would be five times larger; see Remark 2.

10.2. The Three Regimes

For Model T one has ρ * = δ and hence ρ 1 = | γ | in (62), and indeed the deficit of the last column of Table 3 below unity falls by the factor 10 − ρ 1 / ν = 0.5623 per decade, in agreement with the second-order rate. The convergence is slow because χ / ν = 1 / 2 ; this is a feature of the regime and not of the estimate.
Figure 1 exhibits the assertion of Theorem 7 that the relative deviation ζ ( t ; s ) is free of s to leading order, and is worth reading as a picture of the remainder in (62), in which two terms of the same relative order [ τ ( t ) ] − | γ | compete. At s = 0 the term D ( t ; s ) of (66) vanishes identically, so that what is left is the second-order part of J 0 ( t ) , which is negative and holds the curve below unity; for s > 0 the term − D ( t ; s ) > 0 enters, proportional to M ( s ) , and for the two values shown it outweighs that deficit. Since M ( s ) grows without bound as s ↑ 1 while the order in t is the same, the excess is governed by s, and at t = 10 7 it is still 12.9 % when s = 0.9 . The uniformity of (61) on [ 0 , d ] is therefore genuine but is attained slowly when d is close to 1, and it is for that reason that the theorem is not stated on [ 0 , 1 ) .
The remaining two regimes are treated in Figure 2. At s = 0 one has M ( 0 ) = 0 , so that the constant of (75) reduces to − Λ ∞ [ c ℓ − c L ] / ( ν 3 L ∞ ) . The left panel makes visible the point of Remark 8: across the threshold the rate is the same, while the exponent Λ ∞ of the normalisation τ Λ ∞ ( t ) is not. The right panel confirms in the same way the monotone approach of Theorem 11.

10.3. The Correction Term in M ( s )

Finally we quantify Remark 3. What Figure 3 shows is that the omitted term is not a correction of smaller order: it is comparable with the leading term over the whole range and disappears only in the limit, where both sides are dominated by the singularity.
Figure 3. Model T. The ratio D 4 ( s ) of the exact M ( s ) of (17) to the reduced expression [ 1 / V ( 1 − s ) − 1 / a 0 ] / ν , which omits the term I ( 1 / ( 1 − s ) ) of (41). It falls monotonically between the dark lines at 3 / 2 and 1. Both endpoints are limiting values: at s = 0 the two quantities vanish together and the ratio tends to ν a 0 / | a 0 + f ′ ( 0 ) | = 3 / 2 , while as s ↑ 1 both diverge and the ratio tends to 1.
Figure 3. Model T. The ratio D 4 ( s ) of the exact M ( s ) of (17) to the reduced expression [ 1 / V ( 1 − s ) − 1 / a 0 ] / ν , which omits the term I ( 1 / ( 1 − s ) ) of (41). It falls monotonically between the dark lines at 3 / 2 and 1. Both endpoints are limiting values: at s = 0 the two quantities vanish together and the ratio tends to ν a 0 / | a 0 + f ′ ( 0 ) | = 3 / 2 , while as s ↑ 1 both diverge and the ratio tends to 1.
Preprints 234226 g003

10.4. Transfer to the transition probabilities

The bounds of Section 9 were tested on Model T with d = 0.6 , through
D 5 ( t ; j ) : = d j t | p j ( t ) / p 1 ( t ) − v j | and D 6 ( t ) : = t q γ ( t ) sup | s | = d | r ( t ; s ) / r ( s ) − 1 | ,
each a deviation divided by the order predicted for it, by (93) and by (98) respectively. The coefficients entering D 5 ( t ; j ) are extracted by Cauchy’s formula as discrete means over equally spaced points of the circle | s | = d , at which (107) and (108) are evaluated with the principal branches of the powers and of the logarithm, and the ratio in D 6 ( t ) is obtained from (97) by quadrature along the segment from F ( t ; 0 ) to F ( t ; s ) . In Table 4 the deviations settle by t = 10 3 and decrease down the column, so that the geometric factor d − j of (93) is not merely permissible but generous, and the uniform bound (95) multiplied by t converges to 2.2437 . That D 6 ( t ) settles at a positive constant indicates that, for this model, the order of (98) is attained and is not merely an upper bound.

11. Concluding Remarks

We collect the points on which the present treatment departs from the existing one, and the questions it leaves open.
On the hypotheses. Placing the assumptions on the index function ε L ( * ) rather than on the shift remainder w μ ( * ) is not a matter of taste: the two are proportional with a factor that depends on the shift and is therefore not determined once the shift has been suppressed, as Lemma 2 and Remark 1 make precise, whereas the index function is the object the representation theorem provides and the one all the integrations actually use. How the axioms so obtained sit inside the subclass (7) in which this circle of problems is usually set is recorded where they are stated, and it is the two second-order rates admitted there, combined in ρ * of (6), that turn the rates of (62) and (76) into powers of t. Remark 2 records what is gained besides.
On the exact identities. Lemma 3 and Lemma 7 are identities, not asymptotic relations, and the sharpness of everything downstream comes from them. In particular the difference (33) of the identity at two values of s has no logarithmic term at all, the logarithms cancelling exactly; this is what makes the s-uniform statements (61), (75) and (45) possible, and what makes the s-dependent part of the correction of Theorem 4 computable: it is quadratic in M ( s ) and comes from the second-order term of a single expansion, not from the logarithms.
On the transfer to the transition probabilities. The passage from a rate for a generating function to a rate for its coefficients is usually either omitted or bought with a monotonicity hypothesis. Section 9 shows that in the present model it is free. Criticality factors the infinitesimal generating function as f ( z ) = ( 1 − z ) 2 Ω ( z ) with Ω ( * ) a nonvanishing power series with nonnegative coefficients, and this single fact yields both the analyticity of M ( * ) on the whole unit disc and, through Cauchy’s estimate on a disc of radius q ( t ) / 2 around F ( t ; 0 ) , the complex bounds of Lemma 10. Off the real axis the argument uses no property of the branching system beyond criticality and the nonnegativity of the rates, the regular variation entering only through the real-variable estimates already proved, and it should apply verbatim to other critical models in which the generating function satisfies an autonomous first-order equation.
On the classification. Theorem 6 completes the sign criterion of [18,25] by settling the boundary γ = 0 , where the sign carries no information and the threshold is Λ ∞ = ν . It would be of interest to know whether the equality case Λ ∞ = ν can be refined: there p 00 ( t ) is of exact order 1 / t by (54), so that the chain is null recurrent with a return integral that diverges only logarithmically, but the tail of the return time to the origin is not addressed here.
Open question. One restriction remains. The transient regime is treated under the hypothesis that χ of (5) is positive, which is what makes the integral K ( s ) of (56) converge. For χ ≤ 0 the limiting generating function (59) does not exist in the present form and a different normalisation is required; we do not know what it is. The other hypothesis of that regime, c ℓ > 0 , is not a restriction of the same kind: what replaces the rate (61) when it fails is, under ( B * ) with ρ ℓ > | γ | , the rate (68) of Remark 7, and the limit itself is unaffected in any case. Both are restrictions on the parameters, not on the method.

Author Contributions: A.A.Imomov

Conceptualization, Methodology, Formal analysis, Investigation, Validation, Writing – original draft, Writing – review & editing, Supervision, Project administration, Funding acquisition. S.B.Iskandarov: Methodology, Formal analysis, Investigation, Software, Visualization, Writing – review & editing. J.B.Azimov: Methodology, Investigation, Writing – review & editing, Validation. H.Q.Jumaqulov: Investigation, Validation, Software, Visualization. Z.A.Nazarov: Investigation, Validation, Visualization.

Data Availability Statement

No data were used for the research described in this article. All numerical values reported in Section 10 are produced from the closed-form relations (107), (108), (51) and (97) on the parameter sets of Table 1, which are stated there in full.

Acknowledgments

This research work was carried out within the framework of the project programme FL-8824063218 of the Ministry of Higher Education, Science and Innovations of the Republic of Uzbekistan.

Conflicts of Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References

  1. Aljančić, S.; Arandjelović, D. <italic>O</italic>-regularly varying functions. Publ. Inst. Math. (Beograd) (N.S.) 1977, 22(36), 5–22. [Google Scholar] [CrossRef]
  2. Anderson, W. J. Continuous-time Markov chains: an applications-oriented approach; Springer: New York, 1991. [Google Scholar]
  3. Athreya, K. B.; Ney, P. E. Branching processes; Springer: New York, 1972. [Google Scholar]
  4. Barczy, M.; Basrak, B.; Kevei, P.; Pap, G.; Planinić, H. Statistical inference of subcritical strongly stationary Galton–Watson processes with regularly varying immigration. Stoch. Process. Appl. 2021, 132, 33–75. [Google Scholar] [CrossRef]
  5. Barczy, M.; Bosze, Zs.; Pap, G. Regularly varying non-stationary Galton–Watson processes with immigration. Stat. Probab. Lett. 2018, 140, 106–114. [Google Scholar] [CrossRef]
  6. Bingham, N. H.; Goldie, C. M.; Teugels, J. L. Regular variation. In Cambridge University Press; Cambridge, 1987. [Google Scholar]
  7. Bojanic, R.; Seneta, E. Slowly varying functions and asymptotic relations. J. Math. Anal. Appl. 1971, 34(2), 302–315. [Google Scholar] [CrossRef]
  8. Chen, A.; Renshaw, E. Recurrence of Markov branching processes with immigration. Stoch. Process. Appl. 1993, 45(2), 231–242. [Google Scholar] [CrossRef]
  9. Flajolet, P.; Odlyzko, A. Singularity analysis of generating functions. SIAM J. Discret. Math. 1990, 3(2), 216–240. [Google Scholar] [CrossRef] [PubMed]
  10. Foster, J. H.; Williamson, J. A. Limit theorems for the Galton–Watson process with time-dependent immigration. Z. Wahrsch. Verw. Geb. 1971, 20(3), 227–235. [Google Scholar] [CrossRef]
  11. Geluk, J. L.; de Haan, L. Regular variation, extensions and Tauberian theorems; CWI Tract40: Centrum voor Wiskunde en Informatica, Amsterdam, 1987. [Google Scholar]
  12. Goldie, C. M.; Smith, R. L. Slow variation with remainder: theory and applications. Quart. J. Math. Oxf. Ser. (2) 1987, 38(1), 45–71. [Google Scholar] [CrossRef]
  13. de Haan, L.; Stadtmüller, U. Generalized regular variation of second order. J. Austral. Math. Soc. Ser. A 1996, 61(3), 381–395. [Google Scholar] [CrossRef]
  14. Harris, T. E. The theory of branching processes; Springer: Berlin, 1963. [Google Scholar]
  15. Imomov, A. A. On long-term behavior of continuous-time Markov branching processes allowing immigration. J. Sib. Fed. Univ. Math. Phys. 2014, 7(4), 443–454. [Google Scholar] [CrossRef]
  16. Imomov, A. A. On estimation of the convergence rate to invariant measures in Markov branching processes with possibly infinite variance and immigration. J. Sib. Fed. Univ. Math. Phys. 2021, 14(5), 573–583. [Google Scholar] [CrossRef]
  17. Imomov, A. A.; Iskandarov, S. B.; Azimov, J. B.; Jumaqulov, H. Q. Enhanced asymptotic analysis of continuous-time Markov branching systems: revisiting limiting structural theorems. Chaos Solitons Fractals 200(2025), art. 117079. [CrossRef]
  18. Imomov, A. A.; Meyliev, A.Kh. On asymptotic structure of continuous-time Markov branching processes allowing immigration without higher-order moments. Ufa Math. J. 2021, 13(1), 137–147. [Google Scholar] [CrossRef]
  19. Imomov, A. A.; Tukhtaev, E. E. On asymptotic structure of critical Galton–Watson branching processes allowing immigration with infinite variance. Stoch. Model. 2023, 39(1), 118–140. [Google Scholar] [CrossRef]
  20. Imomov, A. A.; Tukhtaev, E. E.; Sztrik, J. On properties of Karamata slowly varying functions with remainder and their applications. Mathematics 2024, 12(20), art. 3266. [Google Scholar] [CrossRef]
  21. Ivanoff, B. G.; Seneta, E. The critical branching process with immigration stopped at zero. J. Appl. Probab. 1985, 22(1), 223–227. [Google Scholar] [CrossRef]
  22. Karlin, S.; McGregor, J. Embeddability of discrete time simple branching processes into continuous time branching processes. Trans. Amer. Math. Soc. 1968, 132(1), 115–136. [Google Scholar] [CrossRef]
  23. Kesten, H.; Ney, P.; Spitzer, F. The Galton–Watson process with mean one and finite variance. Theory Probab. Appl. 1966, 11(4), 513–540. [Google Scholar] [CrossRef] [PubMed]
  24. Lamperti, J.; Ney, P. Conditioned branching processes and their limiting diffusions. Theory Probab. Appl. 1968, 13(1), 128–139. [Google Scholar] [CrossRef] [PubMed]
  25. Li, J.; Chen, A.; Pakes, A. G. Asymptotic properties of the Markov branching process with immigration. J. Theor. Probab. 2012, 25(1), 122–143. [Google Scholar] [CrossRef]
  26. Li, J.; Cheng, L.; Li, L. Long time behaviour for Markovian branching-immigration systems. Discret. Event Dyn. Syst. 2021, 31(1), 37–57. [Google Scholar] [CrossRef]
  27. Mitov, K. V.; Yanev, N. M. Critical Markov branching process with infinite variance allowing Poisson immigration with increasing intensity. Stoch. Anal. Appl. 2024, 42(4), 828–841. [Google Scholar] [CrossRef]
  28. Mitov, K. V.; Yanev, N. M. On a class of critical Markov branching processes with non-homogeneous Poisson immigration. Stoch. Model. 41(4)(2025), 610–623. [CrossRef]
  29. Mitov, K. V.; Yanev, N. M. Markov branching process with infinite variance and non-homogeneous immigration with infinite mean. Preprint 2501.03270. 2025. [Google Scholar] [CrossRef]
  30. Pakes, A. G. On Markov branching processes with immigration. In Sankhyā Ser. A; 1975; Volume 37, pp. 129–138. [Google Scholar]
  31. Pakes, A. G. Some new limit theorems for the critical branching process allowing immigration. Stoch. Process. Appl. 1976, 4(2), 175–185. [Google Scholar] [CrossRef]
  32. Pakes, A. G. Revisiting conditional limit theorems for the mortal simple branching process. Bernoulli 1999, 5(6), 969–998. [Google Scholar] [CrossRef]
  33. Pakes, A. G. Critical Markov branching process limit theorems allowing infinite variance. Adv. Appl. Probab. 2010, 42(2), 460–488. [Google Scholar] [CrossRef]
  34. Seneta, E. Regularly varying functions in the theory of simple branching processes. Adv. Appl. Probab. 1974, 6(3), 408–420. [Google Scholar] [CrossRef]
  35. Sevastyanov, B. A. Limit theorems for branching stochastic processes of special form. Theory Probab. Appl. 1957, 2(3), 321–331. [Google Scholar] [CrossRef]
  36. Sevastyanov, B. A. Branching processes; (In Russian.); Nauka: Moscow, 1971. [Google Scholar]
  37. Slack, R. S. A branching process with mean one and possibly infinite variance. In Z. Wahrsch. Verw. Gebiete; 1968; Volume 9, pp. 139–145. [Google Scholar]
  38. Slack, R. S. Further notes on branching processes with mean 1. In Z. Wahrsch. Verw. Gebiete; 1972; Volume 25, pp. 31–38. [Google Scholar] [CrossRef]
  39. Vatutin, V. A. Limit theorems for critical Markov branching processes with several types of particles and infinite second moments. Mat. Sb. (N.S.);Math. USSR-Sb. English translation. 1977, 103(145) 32(2), 253–264 215–225. [Google Scholar] [CrossRef]
  40. Yang, Y. S. On branching processes allowing immigration. J. Appl. Probab. 1972, 9, 24–31. [Google Scholar] [CrossRef]
  41. Zolotarev, V. M. More exact statements of several theorems in the theory of branching processes. Theory Probab. Appl. 1957, 2(2), 245–253. [Google Scholar] [CrossRef] [PubMed]
  42. Zubkov, A. M. Life-periods of a branching process with immigration. Theory Probab. Appl. 1972, 17(1), 174–183. [Google Scholar] [CrossRef]
Figure 1. Model T. The deviation ζ ( t ; s ) of (60) divided by the leading term predicted for it in (61), at three values of s; the quantity plotted is D 1 ( t ; s ) : = ζ ( t ; s ) δ χ [ ( ν L ∞ t ) χ / ν / ( Λ ∞ c ℓ ) ] , and (61) asserts that it tends to the dark line at 1. All three curves do, the one at s = 0 from below and those at s > 0 from above; at s = 0.9 the excess is still 12.9 % at t = 10 7 .
Figure 1. Model T. The deviation ζ ( t ; s ) of (60) divided by the leading term predicted for it in (61), at three values of s; the quantity plotted is D 1 ( t ; s ) : = ζ ( t ; s ) δ χ [ ( ν L ∞ t ) χ / ν / ( Λ ∞ c ℓ ) ] , and (61) asserts that it tends to the dark line at 1. All three curves do, the one at s = 0 from below and those at s > 0 from above; at s = 0.9 the excess is still 12.9 % at t = 10 7 .
Preprints 234226 g001
Figure 2. Left: Model B on the boundary γ = 0 , the immigration intensity moved across the threshold Λ ∞ = ν , with D 2 ( t ) : = t [ τ Λ ∞ ( t ) p 00 ( t ) / U 0 ( 0 ) − 1 ] ; the dark lines mark the constants − 0.24 and − 0.48 that (75) predicts at s = 0 for the two rows, and each curve settles on its own to four figures. Right: Model R, with D 3 ( t ) : = [ P ( t ; 0 ) / π ( 0 ) − 1 ] γ ( ν L ∞ t ) γ / ν / Λ ∞ , the relative deviation divided by the leading term predicted for it in (84); it decreases monotonically to the dark line at 1, so that both the constant Λ ∞ / γ = 2 and the exponent γ / ν = 0.75 are confirmed at once.
Figure 2. Left: Model B on the boundary γ = 0 , the immigration intensity moved across the threshold Λ ∞ = ν , with D 2 ( t ) : = t [ τ Λ ∞ ( t ) p 00 ( t ) / U 0 ( 0 ) − 1 ] ; the dark lines mark the constants − 0.24 and − 0.48 that (75) predicts at s = 0 for the two rows, and each curve settles on its own to four figures. Right: Model R, with D 3 ( t ) : = [ P ( t ; 0 ) / π ( 0 ) − 1 ] γ ( ν L ∞ t ) γ / ν / Λ ∞ , the relative deviation divided by the leading term predicted for it in (84); it decreases monotonically to the dark line at 1, so that both the constant Λ ∞ / γ = 2 and the exponent γ / ν = 0.75 are confirmed at once.
Preprints 234226 g002
Table 1. The four parameter sets of the family (103) and the constants (105) they produce, one for each regime of Theorem 6. All of them carry the scale c = 1 and the remainder parameters α = 1 / 4 , η = 2 / 5 , so that L ∞ = 1 , a 0 = 3 / 4 and ϑ = c L throughout. The two rows of Model B carry one and the same branching mechanism and differ only in the immigration intensity, which is moved across the threshold Λ ∞ = ν of Theorem 6(ii).
Table 1. The four parameter sets of the family (103) and the constants (105) they produce, one for each regime of Theorem 6. All of them carry the scale c = 1 and the remainder parameters α = 1 / 4 , η = 2 / 5 , so that L ∞ = 1 , a 0 = 3 / 4 and ϑ = c L throughout. The two rows of Model B carry one and the same branching mechanism and differ only in the immigration intensity, which is moved across the threshold Λ ∞ = ν of Theorem 6(ii).
ν δ β γ χ c L c ℓ Λ ∞
Model T transient 0.8 0.6 0.6 − 0.2 0.4 0.2 0.24 0.6
Model B null recurrent 0.5 0.5 0.4 0 0.5 0.125 0.2 0.4
Model B transient 0.5 0.5 0.8 0 0.5 0.125 0.2 0.8
Model R positive recurrent 0.4 0.7 0.6 0.3 1.0 0.1 0.28 0.6
Table 2. Model T. The three-term expansion (29) of the survival probability q ( t ) , in the form of q − ν ( t ) , against the exact value; the last column is the ratio of the two preceding ones.
Table 2. Model T. The three-term expansion (29) of the survival probability q ( t ) , in the form of q − ν ( t ) , against the exact value; the last column is the ratio of the two preceding ones.
t q ( t ) q − ν ( t ) right-hand side of (29) ratio
10 1 6.989189 · 10 − 2 8.403469 8.408219 0.9994350
10 2 4.190501 · 10 − 3 79.833877 79.832573 1.0000163
10 3 2.353108 · 10 − 4 799.257237 799.256927 1.0000004
10 4 1.321986 · 10 − 5 7998.681329 7998.681280 1.0000000
10 5 7.432764 · 10 − 7 79998.105641 79998.105634 1.0000000
10 7 2.350378 · 10 − 9 7999996.954341 7999996.954341 1.0000000
Table 3. Model T, transient regime. Left: the exact identity (70), whose second column approaches the constant u 0 = 29.287017 of that formula. Right: the rate (71), its leading term evaluated at the exact τ ( t ) rather than at ( ν L ∞ t ) 1 / ν ; the tail integral J 0 ( t ) agrees with it up to the O ( τ − δ ) term discarded there, the last column being the ratio of the two. For Model T the coefficient Λ ∞ c ℓ / ( δ χ ) happens to equal Λ ∞ , since c ℓ = δ χ there.
Table 3. Model T, transient regime. Left: the exact identity (70), whose second column approaches the constant u 0 = 29.287017 of that formula. Right: the rate (71), its leading term evaluated at the exact τ ( t ) rather than at ( ν L ∞ t ) 1 / ν ; the tail integral J 0 ( t ) agrees with it up to the O ( τ − δ ) term discarded there, the last column being the ratio of the two. For Model T the coefficient Λ ∞ c ℓ / ( δ χ ) happens to equal Λ ∞ , since c ℓ = δ χ there.
t e Θ ( t ) p 00 ( t ) J 0 ( t ) Λ ∞ c ℓ δ χ [ τ ( t ) ] − χ ratio
10 1 25.012800 1.5776 · 10 − 1 2.0698 · 10 − 1 0.762194
10 2 27.640868 5.7849 · 10 − 2 6.7152 · 10 − 2 0.861465
10 3 28.719674 1.9562 · 10 − 2 2.1223 · 10 − 2 0.921730
10 4 29.099794 6.4132 · 10 − 3 6.7088 · 10 − 3 0.955951
10 5 29.226491 2.0688 · 10 − 3 2.1213 · 10 − 3 0.975226
10 7 29.280854 2.1047 · 10 − 4 2.1213 · 10 − 4 0.992165
Table 4. Model T with d = 0.6 . Left: the limits v j = a 0 m j of (93), the value v 1 = 1 being forced since m 1 = M ′ ( 0 ) = 1 / a 0 , and beside them the deviations D 5 ( t ; j ) of the local ratios from those limits. Right: the scaled supremum D 6 ( t ) of the deviation of r ( t ; s ) from r ( s ) on the circle | s | = d . Both are defined in the text above, each divided by the order predicted for it.
Table 4. Model T with d = 0.6 . Left: the limits v j = a 0 m j of (93), the value v 1 = 1 being forced since m 1 = M ′ ( 0 ) = 1 / a 0 , and beside them the deviations D 5 ( t ; j ) of the local ratios from those limits. Right: the scaled supremum D 6 ( t ) of the deviation of r ( t ; s ) from r ( s ) on the circle | s | = d . Both are defined in the text above, each divided by the order predicted for it.
j v j D 5 ( 10 3 ; j ) D 5 ( 10 4 ; j ) D 5 ( 10 5 ; j ) t D 6 ( t )
2 0.766667 0.54026 0.54006 0.54001 10 2 1.17876
4 0.646148 0.38395 0.38439 0.38441 10 3 1.21622
6 0.587077 0.18840 0.18884 0.18888 10 4 1.22188
8 0.549737 0.08289 0.08318 0.08320 10 5 1.22283
12 0.502403 0.01402 0.01410 0.01410 10 6 1.22300
20 0.449975 0.00032 0.00033 0.00033 10 7 1.22303
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.