Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnaya Matematika, 2017, Volume 29, Issue 2, Pages 18–28
DOI: https://doi.org/10.4213/dm1426 (Mi dm1426) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Limit theorems for bounded branching processes

G. K. Kobanenko

Lomonosov Moscow State University
Full-text PDF (448 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1426
Abstract: The conditions under which the nonextincting trajectories of a discrete time bounded branching process with probability 1: either only finitely many times hit the upper boundary, either infinitely often hit the upper boundary, or coincide with the upper boundary after some random moment.
Keywords: bounded branching process, behavior of trajectories, limit theorems.
Received: 17.02.2017
English version:
Discrete Mathematics and Applications, 2018, Volume 28, Issue 5
DOI: https://doi.org/10.1515/dma-2018-0025
Bibliographic databases:
Document Type: Article
UDC: 519.218.23
Language: Russian
Citation: G. K. Kobanenko, “Limit theorems for bounded branching processes”, Diskr. Mat., 29:2 (2017), 18–28
Citation in format AMSBIB
\Bibitem{Kob17}
\by G.~K.~Kobanenko
\paper Limit theorems for bounded branching processes
\jour Diskr. Mat.
\yr 2017
\vol 29
\issue 2
\pages 18--28
\mathnet{http://mi.mathnet.ru/dm1426}
\crossref{https://doi.org/10.4213/dm1426}
\elib{https://elibrary.ru/item.asp?id=29437292}
Linking options:
  • https://www.mathnet.ru/eng/dm1426
  • https://doi.org/10.4213/dm1426
  • https://www.mathnet.ru/eng/dm/v29/i2/p18
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:401
    Full-text PDF :44
    References:53
    First page:26
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024