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, 1999, Volume 11, Issue 2, Pages 86–102
DOI: https://doi.org/10.4213/dm369
(Mi dm369)
 

This article is cited in 16 scientific papers (total in 16 papers)

On the maximum of a critical branching process in a random environment

V. I. Afanasyev
Abstract: Let $\{\xi_n\}$ be a critical branching process in a random environment with linear-fractional generating functions. We demonstrate that, under some conditions, as $x\to\infty$,
$$ \mathsf P\Bigl(\sup_n\xi_n>x\Bigr)\sim \frac{c_0}{\ln x},\qquad \mathsf P\biggl(\sum_{n=0}^\infty\xi_n>x\biggr)\sim \frac{c_0}{\ln x}, $$
where $c_0$ is a positive constant.
Received: 03.07.1998
Bibliographic databases:
Document Type: Article
UDC: 519.2
Language: Russian
Citation: V. I. Afanasyev, “On the maximum of a critical branching process in a random environment”, Diskr. Mat., 11:2 (1999), 86–102; Discrete Math. Appl., 9:3 (1999), 267–284
Citation in format AMSBIB
\Bibitem{Afa99}
\by V.~I.~Afanasyev
\paper On the maximum of a critical branching process in a random environment
\jour Diskr. Mat.
\yr 1999
\vol 11
\issue 2
\pages 86--102
\mathnet{http://mi.mathnet.ru/dm369}
\crossref{https://doi.org/10.4213/dm369}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1712160}
\zmath{https://zbmath.org/?q=an:0977.60089}
\transl
\jour Discrete Math. Appl.
\yr 1999
\vol 9
\issue 3
\pages 267--284
Linking options:
  • https://www.mathnet.ru/eng/dm369
  • https://doi.org/10.4213/dm369
  • https://www.mathnet.ru/eng/dm/v11/i2/p86
  • This publication is cited in the following 16 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:679
    Full-text PDF :235
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024