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


Diskr. Mat., 2019, Volume 31, Issue 2, Pages 143–151 (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

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

Funding Agency Grant Number
Russian Academy of Sciences - Federal Agency for Scientific Organizations


DOI: https://doi.org/10.4213/dm1560

Full text: PDF file (441 kB)
First page: PDF file
References: PDF file   HTML file

English version:
Discrete Mathematics and Applications, 2020, 30:6, 409–415

Bibliographic databases:

UDC: 519.212.2
Received: 05.11.2018

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://www.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{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000599648900005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85099086491}


Linking options:
  • http://mi.mathnet.ru/eng/dm1560
  • https://doi.org/10.4213/dm1560
  • http://mi.mathnet.ru/eng/dm/v31/i2/p143

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Дискретная математика
    Number of views:
    This page:156
    References:17
    First page:14

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021