Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Asymptotic results f ...
Article

Asymptotic results for silent elimination

Guy Louchard (1), Helmut Prodinger (2) (3)
(1) Département d'Informatique [Bruxelles]
(2) Department of Mathematical Sciences [Matieland, Stellenbosch Uni.]
(3) Department of Mathematical Sciences [Stellenbosch University]
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2010
Last modified on
March 31, 2025
Volume 12
vol. 12:2
DOI
10.46298/dmtcs.527
License
https://about.hal.science/hal-authorisation-v1
Indicators
808
Views
744
Downloads

Asymptotic results for silent elimination

Guy Louchard (1), Helmut Prodinger (2) (3)
(1) Département d'Informatique [Bruxelles]
(2) Department of Mathematical Sciences [Matieland, Stellenbosch Uni.]
(3) Department of Mathematical Sciences [Stellenbosch University]
Abstract
Following the model of Bondesson, Nilsson, and Wikstrand, we consider randomly filled urns, where the probability of falling into urn i is the geometric probability (1-q)qi-1. Assuming n independent random entries, and a fixed parameter k, the interest is in the following parameters: Let T be the smallest index, such that urn T is non-empty, but the following k are empty, then: XT= number of balls in urn T, ST= number of balls in urns with index larger than T, and finally T itself..
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Cited by

Source: OpenCitations

  • The Largest Missing Value in a Sample of Geometric Random Variables

    Combinatorics Probability Computing

    Authors : MARGARET ARCHIBALD ORCID, ARNOLD KNOPFMACHER ORCID

    Journal reference : Volume 23, 2014, pp. 670-685

    DOI : 10.1017/s096354831400011x
Preview
Loading PDF preview...