• Tidak ada hasil yang ditemukan

ξ ε ξ ε Dε

N/A
N/A
Protected

Academic year: 2024

Membagikan "ξ ε ξ ε Dε"

Copied!
5
0
0

Teks penuh

(1)

CONDITIONS FOR THE CONVERGENCE OF BRANCHING PROCESSES WITH IMMIGRATION STARTING FROM A LARGE NUMBER OF PARTICLES

H. K. Zhumakulov

Ph. D., Associate Professor of Kokand State Pedagogical Institute A. Ergashev

Kokand SPI ANNOTATION

In this section, we study sufficient conditions for the convergence of a sequence of almost critical Galton -Watson branching processes with uniform immigration starting from a large number of particles.

Keywords ; Galton -Watson, branching processes , almost critical, random process, Skorokhod spaces

Let for everyone

n  N  

k j( ),n

, , k j  N  and  

k( )n

, k  N  are two independent sets of independent, non-negative, integer- valued and identically distributed random variables. For each n  N, we define the process by the  X

k( )n

, k  N

0

following recursive relations

( )

( ) ( ) 1 ( ) ( )

0 ,

1

0, , .

n

Xk

n n n n

k k j k

j

X X

  k

=

= =  +  N

(one)

If we interpret the value

k j( ),n as the number of descendants of the j -th particle in the -th

k − 1

generation , and the value

k( )n - as the number of particles immigrating into the population in the k -th generation, then the value

X

k( )n is the number of particles in the population in the k - th generation. Due to this interpretation, process (1) is called the Galton -Watson branching process with immigration.

Let us assume that the values

( ) ( ) 2 ( )

1,1n

,

1n

,

1,1n

n n n

m = E   = E   = D 

and

b

n2

= D 

1( )n

are finite for everyone

n  N

. Process (1) is called subcritical , critical and supercritical if

1, 1, 1

n n n

m  m = m 

, respectively. If

m

n

→ 1

for

n → 

, then the sequence (1) is called almost critical.
(2)

Let , for each , be

n  N 

0( )n

a positive integer random variable,

{ 

k j( ),n

, , k j  N }

and

{ 

k( )n

, k  N }

be two mutually independent collections of identically distributed, non-negative, integer- valued random variables that do not depend on

0( )n .

For each

n  N

process

 Xk( )n , k  N0, we define it as follows:

( )

( ) ( ) ( ) 1 ( ) ( )

0 0 ,

1

, , .

n

Xk

n n n n n

k k j k

j

X  X

  k

=

= =  +  N

assume the existence of second moments of the quantities

X

0( )n

, 

k j( ),n ,

k( )n and keep the same notation for the means and variances of the quantities

k j( ),n and

k( )n as at the beginning of § Next, we define a step process

X t

n

( )

as an element of the Skorokhod space

D [0, ] T

, setting

( ) [ ]

( )

n

, 0

n nt

X t = X t 

, where [a] means the integer part of the number a. In what follows, the sign

⎯⎯→

D will mean weak convergence in the Skorokhod topology (see [1]).

The following theorem gives an idea of the asymptotic behavior of the process

X t t

n

( ),  0

for

n → 

in the case when

X

0( )n

⎯⎯

→

(at the beginning there are "many" particles) and

n

1

m →

for

n → 

(almost the critical case).

Theorem . Let

1

n

1

n n

m o

d d

  

= + +  

 

, where

  R

and

d

nbe some sequence of positive numbers such that

n

= nd

n1

→   

for

n → 

. Let

  0

the following conditions be satisfied for some:

n

1

n

→ 

and

n

1

b

n2

→ b

2

, n

1

n2

→ 0

,

n

X

0( )n

⎯⎯

P

→ X

0for

n → 

,

lim

0( )n

n

n EX

→

 

and

EX

0

 

. Then for any

T  0

( )

D

( ), [0, ]

X t

n

t t T

n

⎯⎯→  

at

n → 

,

where the limiting random process

 ( ) t

has the following form
(3)

0

0

( 1), если 0,

( )

, если 0.

t t

X e e

t

X t







 

 

 + − 

=  

 + =

Proof of the theorem. We represent the value

X

k( )n+1in the form

( ) ( ) ( ) ( )

1

( 1) ,

n n n n

k k n k n k

X

+

= X + m − X +  + M

(2)

where

( )

( ) ( ) ( )

, 1

1

( )

n

Xk

n n n

k k j n k n

j

M  m 

+

=

=  − + −

. Obviously, this

M

k( )n

, k  N

0forms a square- integrable martingale difference with respect to the flow of σ-algebras

F

k( )n

( ) ( ) ( )

0 1

{ X

n

, X

n

, , X

kn

}

=

. Let nk

X

k( )n

n

 =

. Then from (2) we have

( )

1 ( )

0

0 1

1 1

, ( ( 1) )

n

n

n nk nk n nk n k

X n m n M

n

n n

 = 

+

=  + −  + 

 +

(3)

It is easy to verify that

( ) ( )

0

1 1

k

n k n n

k n n

n

EX m EX m

m − 

= +

. (four)

Further, applying Doob's inequality for martingales , we have

[ ] [ ] 2

( ) 2 2 ( )

0 0

0

sup 1

nt nT

n n

n k k

k k

t T

I P M n E M

n

 

= =

 

   

=             =

[ ]

2 2 2 ( ) 2

0

[ ]

nT n

n k n

k

n

EX nT b

=

 

=  + 

  

for any

  0

. From here and from (4), after simple calculations, we obtain the estimate
(4)

[ ] 1 2 [ ] 1

2 2 2 ( ) 2

0

1 1

[ ] [ ]

1 1 1

nT nT

n n n n n

n n n

n n n

m m

I n EX nT nT b

m m m

 

 

+

− 

+

−  

    − + −   − −   +   

. (5)

Obviously, if

  0

, then

n

m

n

→ e

at

n → 

.

Then from (5) we have

( )

2 1 1 2 1 0

( ( 1)

n T

n n n

I n e E X

n



 

 

 − +

1 1 2 1 1

( (

T

1) )

n n n n

n

 n

  

e



T

+ − − +

1 2 2

) (1).

n

b T

n

o

+ +

If

 = 0

, then

( )

n

1

n n n

m = +  + o 

and from (5) it follows that

( )

2 1 2 0 1 1 2 1 2 2

n

n n n n n

I n E X n n n b

n

  + + 

 

.

Then, taking into account the conditions of the theorem, we obtain that

n

0

I →

at

n → 

.

Now, applying Theorem 3.1 from [2] and taking into account the last relations, we obtain

1

max

nk nk P

0

k nT

 Z

 

− ⎯⎯ →

at

n → 

, (6)
(5)

( )

1 1

0

0 1

, ( ) 1

n

n nk nk n nk n

Z X Z Z d Z n

n n

+

= = + + 

.

Further, applying Theorem 3.2 from [2], we have

0 1

( ) ( ) 0

sup

n

max

nk P

t T k nT

Z t t Z k

  n

   

− = −       ⎯⎯ →

for

n → 

, where

Z t

n

( ) = Z

n nt[ ], the process

 ( ) t

is a solution of the differential equation

( ) ( ( ))

d  t =   + t dt

with initial condition

 (0) = X

0. From here and (6) it follows that

1 1

0

( ) ( ) 0

sup

n

max

nk nk

max

nk P

k nT k nT

t T

X t k

t Z Z

n

   n

   

 

−  − − −       ⎯⎯ →

for

n → 

, which was to be proved. The proof of the theorem is complete.

LITERATURE

1.

Gikhman I.I., Skorokhod A.V. Theory of random processes. In 3 vols. -M.: Nauka, 1973.

Vol.3. –496 S.

2.

Anisimov V.V., Lebedev E.A. Stochastic queuing networks. Markov models. - Kiev, "L i b i d

" 1992. -207 p.

3.

Formanov , Sh K., and Sh Juraev . "On Transient Phenomena in Branching Random Processes with Discrete Time." Lobachevskii Journal of Mathematics 42.12 (2021): 2777-2784.

4.

Khusanbaev , Ya. M., Kh. K. Zhumakulov . "On the convergence of almost critical branching processes with immigration to a deterministic process." O'ZBEKISTON MATEMATIKA JURNALI (2017): 142.

5.

Zhumakulov Kh.K. On the asymptotics of an almost critical branching process with immigration. // DAN RUz . - Tashkent, 2010. - No. 1. - S. 7-10.

6.

Khusanbaev Ya.M., Zhumakulov H.K. On the asymptotic behavior of critical branching processes with immigration. // UzMJ. - Tashkent, 2017. - No. 1. - S. 146-155.

7.

Khusanbaev Ya.M., Zhumakulov H.K. On the convergence of almost critical branching processes with immigration to a deterministic process. // UzMJ. - Tashkent, 2017. - No. 3. - S.

142-148.

8. Muydinjanov , Davlatjon R. "Holmgren problem for Helmholtz equation with the three singular coefficients." e-Journal of Analysis and Applied Mathematics 2019.1 (2019): 15-30.

Referensi

Dokumen terkait