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, 2019, Volume 31, Issue 2, Pages 143–151
DOI: https://doi.org/10.4213/dm1560
(Mi dm1560)
 

On the waiting times to repeated hits of cells by particles for the polynomial allocation scheme

B. I. Selivanov, V. P. Chistyakov

Steklov Mathematical Institute of Russian Academy of Sciences, Moscow
References:
Abstract: We consider random polynomial allocations of particles over $N$ cells. Let $ \tau_k, \ k \geq 1, $ be the minimal number of trials when $k$ particles hit the occupied cells. For the case $N\to\infty$ the limit distribution of the random variable $ \tau_k/\sqrt{N} $ is found. An example of application of $\tau_k$ is given.} \keywords{ polynomial allocation, waiting time, occupied cells, distribution density
Keywords: polynomial allocation, waiting time, occupied cells, distribution density.
Received: 05.11.2018
English version:
Discrete Mathematics and Applications, 2020, Volume 30, Issue 6, Pages 409–415
DOI: https://doi.org/10.1515/dma-2020-0037
Bibliographic databases:
Document Type: Article
UDC: 519.212.2
Language: Russian
Citation: B. I. Selivanov, V. P. Chistyakov, “On the waiting times to repeated hits of cells by particles for the polynomial allocation scheme”, Diskr. Mat., 31:2 (2019), 143–151; Discrete Math. Appl., 30:6 (2020), 409–415
Citation in format AMSBIB
\Bibitem{SelChi19}
\by B.~I.~Selivanov, V.~P.~Chistyakov
\paper On the waiting times to repeated hits of cells by particles for the polynomial allocation scheme
\jour Diskr. Mat.
\yr 2019
\vol 31
\issue 2
\pages 143--151
\mathnet{http://mi.mathnet.ru/dm1560}
\crossref{https://doi.org/10.4213/dm1560}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3962506}
\elib{https://elibrary.ru/item.asp?id=37652134}
\transl
\jour Discrete Math. Appl.
\yr 2020
\vol 30
\issue 6
\pages 409--415
\crossref{https://doi.org/10.1515/dma-2020-0037}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000599648900005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85099086491}
Linking options:
  • https://www.mathnet.ru/eng/dm1560
  • https://doi.org/10.4213/dm1560
  • https://www.mathnet.ru/eng/dm/v31/i2/p143
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:367
    Full-text PDF :40
    References:46
    First page:23
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024