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, 2016, Volume 28, Issue 4, Pages 58–79
DOI: https://doi.org/10.4213/dm1393
(Mi dm1393)
 

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

Reduced multitype critical branching processes in random environment

Elena E. D'yakonova

Steklov Mathematical Institute of Russian Academy of Sciences, Moscow
Full-text PDF (578 kB) Citations (5)
References:
Abstract: We consider a multitype critical branching process $\mathbf{Z}_{n},n=0,1,...$, in an i.i.d. random environment. Let $Z_{m,n}$ be the number of particles in this process at time $m$ having descendants at time $n$. A limit theorem is proved for the logarithm of $Z_{nt,n}$ at moments $nt,\,0\leq t\leq 1,$ conditioned on the survival of the process $\mathbf{Z}_{n}$ up to moment $n$ when $n\rightarrow \infty $.
Keywords: multitupe branching processes, reduced branching processes, random environment.
Funding agency Grant number
Russian Science Foundation 14-50-00005
This work was supported by the Russian Science Foundation under grant no. 14-50-00005.
Received: 25.10.2016
English version:
Discrete Mathematics and Applications, 2018, Volume 28, Issue 1, Pages 7–22
DOI: https://doi.org/10.1515/dma-2018-0002
Bibliographic databases:
Document Type: Article
UDC: 519.218.27
Language: Russian
Citation: Elena E. D'yakonova, “Reduced multitype critical branching processes in random environment”, Diskr. Mat., 28:4 (2016), 58–79; Discrete Math. Appl., 28:1 (2018), 7–22
Citation in format AMSBIB
\Bibitem{Dya16}
\by Elena~E.~D'yakonova
\paper Reduced multitype critical branching processes in random environment
\jour Diskr. Mat.
\yr 2016
\vol 28
\issue 4
\pages 58--79
\mathnet{http://mi.mathnet.ru/dm1393}
\crossref{https://doi.org/10.4213/dm1393}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3699322}
\elib{https://elibrary.ru/item.asp?id=28119092}
\transl
\jour Discrete Math. Appl.
\yr 2018
\vol 28
\issue 1
\pages 7--22
\crossref{https://doi.org/10.1515/dma-2018-0002}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000425893900002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85054978369}
Linking options:
  • https://www.mathnet.ru/eng/dm1393
  • https://doi.org/10.4213/dm1393
  • https://www.mathnet.ru/eng/dm/v28/i4/p58
  • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:411
    Full-text PDF :36
    References:52
    First page:24
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024