Skip to main content

Refined Limit Theorems for the Critical Continuous-Time Markov Branching Systems

  • Conference paper
  • First Online:
Information Technologies and Mathematical Modelling. Queueing Theory and Applications (ITMM 2022)

Abstract

We consider a critical homogeneous-continuous-time Markov branching system, i.e. the average value of the branching rate is zero. Our basic assumption is that the branching rate generating function of the system regularly varies, in which slowly varying factor varies at infinity with an explicit expression remainder. We essentially rely on the improved version of the Basic Lemma of the critical Markov branching systems theory. First we establish a convergence rate in the Monotone ratio theorem. Subsequently we prove a local-convergence limit theorem on the asymptotic expansion of transition probabilities and their convergence to the invariant measure.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Asmussen, S., Hering, H.: Branching processes. Birkhäuser, Boston (1983)

    Book  MATH  Google Scholar 

  2. Athreya, K.B., Ney, P.E.: Branching processes. Springer, New York (1972). https://doi.org/10.1007/978-3-642-65371-1

    Book  MATH  Google Scholar 

  3. Bingham, N.H., Goldie, C.M., Teugels, J.L.: Regular Variation. Univ. Press, Cambridge (1987)

    Book  MATH  Google Scholar 

  4. Li, J., Cheng, L., Li, L.: Long time behaviour for Markovian branching-immigration systems. Discrete Event Dyn. Syst. 31(1), 37–57 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  5. Feller, W.: An introduction to probability theory and its applications, v.2. JW & Sons (1971)

    Google Scholar 

  6. Harris, T.E.: The Theory of Branching Processes. Springer-Verlag, Berlin (1963)

    Book  MATH  Google Scholar 

  7. Heathcote C. R. A branching process allowing immigration. Jour. Royal Stat. Soc. B-27(1), 138–143 (1965)

    Google Scholar 

  8. Imomov, A.A.: On a limit structure of the Galton-Watson branching processes with regularly varying generating functions. Prob. and math. stat. 39(1), 61–73 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  9. Imomov, A.A., Meyliyev, A.: On application of slowly varying functions with remainder in the theory of Markov Branching Processes with mean one and infinite variance. Ukr. Math. J. 73(8), 1225–1237 (2022)

    Article  MathSciNet  MATH  Google Scholar 

  10. Imomov A.A., Tukhtaev E.E.: On asymptotic structure of critical Galton-Watson branching processes allowing immigration with infinite variance. Stochastic Models, Publ. (2022). https://doi.org/10.1080/15326349.2022.2033628

  11. Imomov A.A.: Limit properties of transition functions of continuous-time Markov branching processes. Int. J Stoch. Analysis 2014, 409345 (2014). https://doi.org/10.1155/2014/409345

  12. Imomov, A.A.: On long-term behavior of continuous-time Markov branching processes allowing immigration. J Sib. Fed. Univ. Math. Phys. 7(4), 443–454 (2014)

    Article  MATH  Google Scholar 

  13. Jagers, P.: Branching Progresses with Biological applications. Pitman Press, GB, JW & Sons (1975)

    MATH  Google Scholar 

  14. Pakes, A.G.: Critical Markov branching process limit theorems allowing infinite variance. Adv. Appl. Prob. 42, 460–488 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Pakes, A.G.: Revisiting conditional limit theorems for the mortal simple branching process. Bernoulli 5(6), 969–998 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  16. Pakes, A.G.: Some results for non-supercritical Galton-Watson process with immigration. Math. Biosci. 24, 71–92 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  17. Seneta, E.: Regularly Varying Functions. Springer, Berlin (1972). https://doi.org/10.1007/BFb0079658

    Book  MATH  Google Scholar 

  18. Sevastyanov, B.A.: Branching Processes. Nauka, Moscow, Russia (1971)

    Google Scholar 

  19. Sevastyanov, B.A.: The theory of Branching stochastic process. Uspekhi Mathematicheskikh Nauk 6(46), 47–99 (1951)

    Google Scholar 

  20. Slack, R.S.: A branching process with mean one and possible infinite variance. Wahrscheinlichkeitstheor. und Verv. Geb. 9, 139–145 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  21. Zolotarev, V.M.: More exact statements of several theorems in the theory of branching processes. Theory Prob. Appl. 2, 245–253 (1957)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Contributions

A. Imomov conceived the relevance of the task and determined the way to solve it. M. Murtazaev, with the support of A. Imomov, implemented the idea of a method for solving the problem, and both wrote this article.

Corresponding author

Correspondence to Azam A. Imomov .

Editor information

Editors and Affiliations

Ethics declarations

Conflict of Interest

The authors declare that they have no conflict of interest.

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Imomov, A.A., Murtazaev, M. (2023). Refined Limit Theorems for the Critical Continuous-Time Markov Branching Systems. In: Dudin, A., Nazarov, A., Moiseev, A. (eds) Information Technologies and Mathematical Modelling. Queueing Theory and Applications. ITMM 2022. Communications in Computer and Information Science, vol 1803. Springer, Cham. https://doi.org/10.1007/978-3-031-32990-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-32990-6_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-32989-0

  • Online ISBN: 978-3-031-32990-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics