Abstract
A decomposable Galton - Watson process with two types of particles is considered. Particles of the first type produce equal random numbers of particles of both types, particles of the second type produce particles of the second type only. Under the condition that the total number of the first type particles is equal to N the functional limit theorems are proved for the numbers of particles of both types existing at times of the orders of
Originally published in Diskretnaya Matematika (2015) 27, N2, 22-44 (in Russian).
Funding source: Russian Science Foundation
Award Identifier / Grant number: 14-50-00005
Funding statement: This work was supported by the Russian Science Foundation under grant no. 14-50-00005
References
[1] Vatutin V.A., D’yakonova E. E., “Decomposable branching processes with a fixed extinction moment”, Proc. Steklov Inst. Math.290 (2015), 103-124.10.1134/S0081543815060103Suche in Google Scholar
[2] Kolchin V.F., “Random mappings”, Trans. Ser. in Math. and Eng., Optimization Software Inc. Publications Division, New York, 1986, 207 pp.Suche in Google Scholar
[3] Drmota M., “On the profile of random trees”, Random Struct. Alg., 10 :4 (1997), 421-451.10.1002/(SICI)1098-2418(199707)10:4<421::AID-RSA2>3.0.CO;2-WSuche in Google Scholar
[4] Lamperti J., “Limiting distributions for branching processes”, Univ. California Press., Proc. Fifth Berkeley Sympos. Math. Statist. and Probab., 1967, 225-241.10.1525/9780520325340-018Suche in Google Scholar
[5] Lindvall T., “Convergence of critical Galton-Watson branching processes”, J. Appl. Probab., 9 :2 (1972), 445-450.10.2307/3212815Suche in Google Scholar
[6] Billingsley P., Convergence of probability measures, Wiley, 1968, 262 pp.Suche in Google Scholar
© 2016 Walter de Gruyter GmbH, Berlin/Boston
Artikel in diesem Heft
- Frontmatter
- Article
- Functional limit theorems for the decomposable branching process with two types of particles
- Article
- Completeness problem for the class of linear automata functions
- Article
- Estimates of accuracy of the Poisson approximation for the distribution of number of runs of long string repetitions in a Markov chain
- Article
- Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms
- Article
- A Markov chain with number-theoretic limit distribution
Artikel in diesem Heft
- Frontmatter
- Article
- Functional limit theorems for the decomposable branching process with two types of particles
- Article
- Completeness problem for the class of linear automata functions
- Article
- Estimates of accuracy of the Poisson approximation for the distribution of number of runs of long string repetitions in a Markov chain
- Article
- Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms
- Article
- A Markov chain with number-theoretic limit distribution