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

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 4, Pages 143–157
DOI: https://doi.org/10.4213/dm1456
(Mi dm1456)
 

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

Limit Poisson law for the distribution of the number of components in generalized allocation scheme

A. N. Timashev

Institute of Cryptography, Communications and Informatics
References:
Abstract: We consider problems on the convergence of distributions of the total number of components and numbers of components with given volume to the Poisson law. Sufficient conditions of such convergence are given. Our results generalize known statemets on the limit Poisson laws of the number of components (cycles, unrooted and rooted trees, blocks and other structures) in the corresponding generalized allocation schemes.
Keywords: generalized allocation scheme, Poisson distribution, components, cycles, blocks, trees, saddle-point method.
Received: 29.05.2017
English version:
Discrete Mathematics and Applications, 2019, Volume 29, Issue 4, Pages 255–266
DOI: https://doi.org/10.1515/dma-2019-0023
Bibliographic databases:
Document Type: Article
UDC: 519.214+519.212.2
Language: Russian
Citation: A. N. Timashev, “Limit Poisson law for the distribution of the number of components in generalized allocation scheme”, Diskr. Mat., 29:4 (2017), 143–157; Discrete Math. Appl., 29:4 (2019), 255–266
Citation in format AMSBIB
\Bibitem{Tim17}
\by A.~N.~Timashev
\paper Limit Poisson law for the distribution of the number of components in generalized allocation scheme
\jour Diskr. Mat.
\yr 2017
\vol 29
\issue 4
\pages 143--157
\mathnet{http://mi.mathnet.ru/dm1456}
\crossref{https://doi.org/10.4213/dm1456}
\elib{https://elibrary.ru/item.asp?id=30737817}
\transl
\jour Discrete Math. Appl.
\yr 2019
\vol 29
\issue 4
\pages 255--266
\crossref{https://doi.org/10.1515/dma-2019-0023}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000481416500005}
Linking options:
  • https://www.mathnet.ru/eng/dm1456
  • https://doi.org/10.4213/dm1456
  • https://www.mathnet.ru/eng/dm/v29/i4/p143
  • This publication is cited in the following 6 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:457
    Full-text PDF :70
    References:75
    First page:29
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025