Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find






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


Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2018, Volume 9, Issue 4, Pages 53–72
DOI: https://doi.org/10.4213/mvk270
(Mi mvk270)
 

Conditional limit theorem for the near critical branching processes with final type of particles

V. A. Vatutin

Steklov Mathematical Institute of Russian Academy of Sciences, Moscow
References:
Abstract: A limit theorem is proved for the distribution of the number of particles in the near critical branching processes with final type of particles conditioned on the survival of the processes up to a distant moment.
Key words: decomposable branching process, final type of particles, population size, conditional limit theorem.
Received 18.IV.2018
Bibliographic databases:
Document Type: Article
UDC: 519.218.23
Language: Russian
Citation: V. A. Vatutin, “Conditional limit theorem for the near critical branching processes with final type of particles”, Mat. Vopr. Kriptogr., 9:4 (2018), 53–72
Citation in format AMSBIB
\Bibitem{Vat18}
\by V.~A.~Vatutin
\paper Conditional limit theorem for the near critical branching processes with final type of particles
\jour Mat. Vopr. Kriptogr.
\yr 2018
\vol 9
\issue 4
\pages 53--72
\mathnet{http://mi.mathnet.ru/mvk270}
\crossref{https://doi.org/10.4213/mvk270}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3942686}
\elib{https://elibrary.ru/item.asp?id=37652152}
Linking options:
  • https://www.mathnet.ru/eng/mvk270
  • https://doi.org/10.4213/mvk270
  • https://www.mathnet.ru/eng/mvk/v9/i4/p53
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математические вопросы криптографии
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024