УДК 519.218.2
On Application of Slowly Varying Functions with Remainder in the Theory of Galton-Watson Branching Process
Azam А. Imomov*
State Testing Center under the Cabinet of Ministers of the Republic of Uzbekistan
12, Bogishamol st., 100202, Tashkent Karshi State University 17, Kuchabag st., Karshi city, 180100 Uzbekistan
Erkin E. TukhtaeV
Karshi State University 17, Kuchabag st., Karshi city, 180100 Uzbekistan
Received 27.06.2018, received in revised form 17.08.2018, accepted 07.10.2018 We investigate an application of slowly varying functions (in sense of Karamata) in the theory of Galton-Watson branching processes. Consider the critical case so that the generating function of the per-capita offspring distribution has the infinite second moment, but its tail is regularly varying with remainder. We improve the Basic Lemma of the theory of critical Galton-Watson branching processes and refine some well-known limit results.
Keywords: Galton-Watson branching process, slowly varying functions, generating functions. DOI: 10.17516/1997-1397-2019-12-1-51-57.
1. Introduction and preliminaries
A conception of slow variation (or more general - regular variation) was initiated first by Jovan Karamata in [7,8]. Zolotarev [15] one of the first demonstrated an encouraging perspective of application of the conception of slow variation in probability theory, in particular in the theory of stochastic branching processes. Afterwards Slack [13,14] and Seneta [9], [10,12] prove principally new limit theorems for branching processes using slowly varying (SV) functions. Remind that real-valued, positive and measurable function l(x) is said to be SV at infinity in sense of Karamata if £(Xx)/£(x) ^ 1 as x ^ x> for each A > 0. A function V(x) is said to be regularly varying at infinity with index of regular variation p G R+ if it in the form V(x) = xpl(x), where l(x) is SV at infinity. We refer the reader to [1,3] and [11] for more information.
Let F(s) = Pjsj denote an offspring probability generating function (PGF) of Galton-
je No
Watson (GW) branching process, where N0 = {0} U N and N = {1,2,...}. Supposing that
Po > 0 we consider the case when the mean per-capita offspring number ^ jpj = 1, that is the
jeN
1 [email protected] © Siberian Federal University. All rights reserved
process is critical, see [2]. Moreover we assume that PGF F(s) for 0 < s < 1 has the following representation:
F(s) = s + (1 - s)'+v-—y (1)
where 0 < v < 1 and L(t) is SV at infinity. By the criticality of our process the condition (1) implies that the second moment F"(1-) = to. This includes the case F'' (1-) < to when v = 1 and L(t) ^ F''(1—)/2 as t ^ to.
Let Zn be the population size in n-th generation. Process evolution is characterized by transition probabilities Pj(n) := P {Zn = j \Z0 = i}. In this interpretation pj = P {Zi = j} provided that P{Zo = 1} = 1. A PGF
Fn(s) =J2 Pij(n)sj
j£No
is the n-fold iteration of F(s), see [2]. Further by the symbol H = min{n : Zn = 0} we denote a time of extinction of GW process. Write Rn(s) := 1 — Fn(s) and needless to say Qn := P{H >n} = Rn(0).
The following theorem is known.
Theorem S [14]. If the condition (1) holds then
lim P {QnZn < x\H >n} = G(x), where G(x) has the Laplace transform
*(6) = 1 — (1 + o-v )-1/v.
By arguments of Slack [14] one can be shown that if the condition (1) holds then
1 ï 1
— i ^ —
Qn ) VU
Slack [14] also has shown that
Q"£(OÙ ~ - aS n (2)
Un(s):= Fn(S) Fn(°\ U(s) as n ^ to, (3)
n() Fn(0) - Fn-i(0) () K>
for 0 < s < 1, where U (F (s)) = U (s) + 1 and
U(s) = ^j-1v+ f/L-vT as s f 1.
v (1 - s) L (1/(1 - s))
Combining (1), (2) and (3) we have
Rn(s)
Un(s) ~ Un(s) :=
1
vn as n oo.
Qn
So we have proved the following lemma as a generalization of the assertion (2) for all s e [0,1).
Lemma 1.1. If the condition (1) holds then
R ( ) N (n) I" Un(s) -
Rn(s) = —1JV • 1 — ( vn)
where the function N(x) is SV at infinity and
n(n) • l1/v ( (vnl1/l 1 as n ^ to, V n(n) )
(n)
and the function Un(s) enjoys following properties:
(i) Un(s) = U(s) (1 + o(1)) as n
(ii) lims|i Un(s) = vn for each fixed n £ N,
(iii) Un(0) = 0 for each fixed n £ N.
We obtain the Lemma 1.1 by more simple proof rather than as shown in [6]. This lemma is called the Basic Lemma of the theory of critical GW branching process. The following lemma established in [6] is differential analogue of Lemma 1.1
Lemma 1.2. If the condition (1) holds then
dRn(s) _ (Rn(s) \1+v L (1/Rn(s))
f^Rn(s)^
ds V1 " s/ L (1/(1 - s))
Since L(x) is SV-function we can write
L (Ax) . .
-FTY = 1 + a(x) (4)
L(x)
for each A > 0, where a(x) ^ 0 as x ^ x>. Henceforth we suppose that some positive function g(x) is given so that g(x) ^ 0 and a(x) = o(g(x)) as x ^ x>. In this case L(x) is called SV with remainder, see [3, p. 185, condition SR3].
We devote this paper to improvement of the Lemma 1.1 provided that the condition (4) holds with given a(x). Subsequently of this we will improve the Lemma 1.2 and define a speed rate in some well-known limit theorems from the theory of critical GW branching process.
2. Improvement of the Basic Lemma and results
Everywhere in this section we suppose the condition (4) holds. Write
Hy):= F(1 - y)- (1 - y) = / 1
y \y
Note that the function yA(y) is positive and tends to zero and has a monotone derivative for y G (0,1] so that yA'(y)/A(y) ^ v as y I 0, see [3, p. 401]. Hence we can write
yA'(y) . .
w=v+s(y),
where S(y) is continuous and S(y) ^ 0 as y I 0. Integrating this equality we obtain
rv S(u)
11 u
We have considered that A(1) = L(1) = p0 in last step. Therefore we have
rv
fy ö(u)
A(y)= poyv exp -du■
Ji u
fy ¿(u) , L\— = p0 exp -du■
\yj Ji u
(1)
Changing variables as u = 1/t in integrand gives
L (x) = p0 exp i —^dt, (5)
it
where e(t) is continuous and e(t) ^ 0 as t ^ x>. It follows from (5) and (4) that
C(\x) rx e(t)
—— = exp — —(x) Jx t
for each A > 0. Hereof
'Ax e(t)
fXx £(t) , ,
-dt = 1 + a(x) as x ^ to
Jx t
i — dt = ln[1 + a(x)] = a(x) + O (a2(x)) xt
a2(x)) as x oo.
t
Using the mean value theorem in the left-hand side of this equality we can be convinced that
e(x) = O(a(x)) as x ^ to. (6)
Further we will consider a case when
a(x) = o ^ as x ^ to. (7)
Denote
$(y) := 1 — F (1 — y) = y — yA(y). In pursuance of reasoning from [14] we obtain the following asymptotic relation:
11
v + S(y), (8)
A(#y)) A(y)
where 5(y) is continuous function so that 5(y) ^ 0 as y I 0, see also [3, p. 401].
Further discussions allow us to estimate the tail-part 5(y) in (8). At first we will prove the following lemma.
Lemma 2.1. Let conditions (1), (4) and (7) hold. Then
£(¿})= £( 1)(1 + ° (A(y))) as y | 0. (9)
Proof. Since the function L(x) = xvA(1/x) is differentiable, by virtue of the mean value
theorem we have , x ,. „. N .
„/ x \ „. . „, (1 — OA \ xA . .
H 1—A) —L(x) = C\T—Ax) • 1—A' (10)
where A := A(1/x) and 0 < O < 1. From integral representation (5) and considering (6) it follows that
(u) = —(u)-^ = o( —^ ) as u ^to. (11)
N e(n) = / L2 (u)N u y«1
Denote u = (1 — 6 A) x/(1 — A). Since A(1/x) ^ 0 then u ~ x and L(u) ~ L(x) as x ^ to. Therefore using (11) in the equality (10) and after some elementary transformations the assertion (9) readily follows. The lemma is proved. □
Lemma 2.2. Let conditions (1), (4) and (7) hold. Then
1 1 = v + ^A(y) + 7 (y), (12)
A(j(y)) A(y) 2
where j(y) = o(A(y)) as y I 0. Proof. Write
K(y) :=
— (ï) - (1 - A(y))V £( m.
M*.„)) A(y) A(y) • (1 - A(y))" — ( JL
1
1
Taking into consideration (9) the last relation becomes
K m = - my(1 + o{m) as y; ° (13)
By the Taylor expansion the head part of (13)
1 " (1 " Hy)^ = v + ^A(y) + O(A\y)) as y |
A(y 1 - A(y 2
From here and (13) the formula (12) now easily follows. The lemma is proved. □
The following assertion is improved analogy of the Basic Lemma.
Lemma 2.3. Let conditions (1), (4) and (7) hold. Then
1 1 vn ■ ln(1 + vnA(1 - s))+ Pn(s), (14)
A(Rn(s)) A(1 - s) 2
where pn(s) = o(lnn) + an(s) and, an(s) is bounded uniformly for s G [0,1) and converges to a limit a(s) as n ^ to which is a bounded function of s G [0,1).
Proof. Note that Rk+1(s) = ^(Rk(s)). It is known that Rk(s) ^ 0 as k ^ to uniformly for s G [0,1), see [2, p. 6]. Therefore putting y = Rk(s) it follows from (12) that
1 1 = v + V~^^A(Rk (s)) + 7 (Rk (s)),
A(Rk+1(s)) A(Rk(s)) 2
where y(v) = o(A(y)) as y I 0. Summing both sides of last equality on k from 1 to n we obtain
1 1 ( + 1) n-i n-1
1 1 = vn +v(v±lij2A(Rk(s)) + £ Yk (s), (15)
A(Rn(s)) A(M.s)) 2
fc=0 fc=0
where s) = o(A(Rk(s) j). Since A(Rn(s)) ^ 0 uniformly for s G [0,1) each of the last two sums on the right-hand side of (15) is o(n) as n ^ to. So that considering R0(s) = 1 - s, we have
11
—T-)---(-) ~ vn as n 00.
A(Rn(s)) A(1 - s) Thus and so vnA(Rn(s)) ^ 1 uniformly for s G [0,1) as n ^ to. Hence
n-l
J2H Rk (s))= O (ln n) k=o
n-l
and Yk (s) = o(ln n) as n ^ to. Thus we obtain
k=0
11
A(Rn(s)) A(l - s) Next, using (16), we have
vn + O (ln n) as n —>■ to. (16)
( ) 1 O (ln k)
uk(s):=A(Rk(s)) - = ( '
vk + A-1(1 - s) (vk + A-1(1 - s) + O(lnk))( vk + A-1(1 - s)) ~ _ O(ln k)
(vk + A-1(1 - s)f + O((k + A-1(1 - s)) lnk)
Since 0 < s < 1, the right-hand side of last equality is O (ln k/k2). Hence it follows that \uk(s)| < to for all s G [0,1). Returning to (15) we see that the sum in second term in (15)
fceNo
n-1 A(1 - s) n-1 is J2 tv-,-r-;-7 + J2 uk (s). In turn by standard arguments [4, p. 544] we see that the
k=0 A(1 - s)vk +1 k=0 expression
n-1 A(1 - s) ln(1 + vnA(1 - s)) k=0 A(1 - s)vk + 1 v
is bounded uniformly for s G [0,1) and approaches a limit as n ^ to which is a bounded function
of s G [0,1). Thus since the bound on the uk(s) is uniform for s G [0,1), the expression 1 1 1 + n-1 ( )
A(RJM - ATS) - vn • ln(1 + vnA(1 - s)) - k==0Yk(s)
converges to a bounded limit as n ^ to uniformly for s G [0,1). Finally, since the second sum n-1 ( ) ( )
in (15) J2 7k(s) _ °(lnn) the formula (14) is fair. The lemma is proved. □
k=0
Remark 1. The assertion (14) was proved in [5, pp. 20-21] provided that F'''(1-) is finite.
Now using Lemma 2.3 we can improve the assertion (2). In fact putting s _ 0 and, after elementary arguments we obtain the following results.
Theorem 2.1. Let conditions (1), (4) and (7) hold. Then
} N(n) f 1 + vln n (ln n\\
p{ >n_ l1 -^-n-+
as n ^ to, where N(n) is SV-function and defined in Lemma 1.1
By the same way we obtain the following local limit theorem which is improvement of the analogous result from the paper [6].
Theorem 2.2. If conditions (1), (4) and (7) hold, then
( )1+1/^ j3 t \ Nv(n) (1 + v)2 lnn flnn\\
^ ^ P11(n)_ — i1 — + where Nv(n)N-1(n) ^ 1 as n ^ to.
References
[1] S.Asmussen, H.Hering, Branching processes, Birkhauser, Boston, 1983.
[2] K.B.Athreya, P.E.Ney, Branching processes, Springer, New York, 1972.
[3] N.H.Bingham, C.M.Goldie, J.L.Teugels, Regular Variation, Univ. Press, Cambridge, 1987.
[4] G.M.Fihtengols, Cours of differential and integral calculus, vol. 2, Nauka, Moscow, 1970 (in Russian).
[5] T.E.Harris, The theory of branching processes, Springer-Verlag, Berlin, 1963.
[6] A.A.Imomov, On a limit structure of the Galton-Watson branching processes with regularly varying generating functions, Probability and mathematical statistics (to appear), 2018.
[7] J.Karamata, Sur un mode de croissance reguliere. Theoremes fondamenteaux, Bull. Soc. Math. France, 61(1933), 55-62.
[8] J.Karamata, Sur un mode de croissance reguliere des fonctions, Mathematica (Cluj), 4(1930), 38-53.
[9] E.Seneta, Regularly varying functions in the theory of simple branching process, Adv. Appl. Prob., 6(1974), 408-420.
[10] E.Seneta, A Tauberian Theorem of E.Landau and W.Feller, Ann. Prob., 1(1973), 1057-1058.
[11] E. Seneta, Regularly Varying Functions, Springer, Berlin, 1972.
[12] E.Seneta, On invariant measures for simple branching process, Jour. Appl. Prob., 8(1)(1971), 43-51.
[13] R.S.Slack, Further notes on branching processes with mean 1, Wahrscheinlichkeitstheor. und Verv. Geb, 25(1972), 31-38.
[14] R.S.Slack, A branching process with mean one and possible infinite variance, Wahrscheinlichkeitstheor. und Verv. Geb., 9(1968), 139-145.
[15] V.M.Zolotarev, More exact statements of several theorems in the theory of branching processes, Theory Prob. and Appl., 2(1957), 245-253.
О применении медленно меняющихся функций с остатком в теории ветвящихся процессов Гальтона-Ватсона
Азам А. Имомов
Государственный центр тестирования при Кабинете Министров Республики Узбекистан
Богишамол, 12, 100202, Ташкент Каршинский государственный университет Кучабаг, 17, Карши, 180100, Узбекистан
Эркин Э. Тухтаев
Каршинский государственный университет Кучабаг, 17, Карши, 180100, Узбекистан
В работе мы исследуем применение медленно меняющихся функций (в смысле Карамата) в теории ветвящихся процессов Гальтона-Ватсона. Рассмотрим критический случай такой, что производящая функция распределения прямого потомка одной частицы имеет бесконечный второй момент, но его хвост регулярно меняется с остатком. Мы уточняем основную лемму теории критических ветвящихся процессов Гальтона-Ватсона и улучшаем некоторые известные асимптотические результаты.
Ключевые слова: ветвящийся процесс Гальтона-Ватсона, медленно меняющиеся функции, производящие функции.