Asymptotic results for silent elimination
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 sm...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2010-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/527/pdf |
| _version_ | 1797270153405136896 |
|---|---|
| author | Guy Louchard Helmut Prodinger |
| author_facet | Guy Louchard Helmut Prodinger |
| author_sort | Guy Louchard |
| collection | DOAJ |
| description | 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.. |
| first_indexed | 2024-04-25T01:59:44Z |
| format | Article |
| id | doaj.art-99282024085746e0995c33fb95c5b742 |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T01:59:44Z |
| publishDate | 2010-01-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-99282024085746e0995c33fb95c5b7422024-03-07T15:15:53ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502010-01-01Vol. 12 no. 210.46298/dmtcs.527527Asymptotic results for silent eliminationGuy Louchard0Helmut Prodinger1Département d'Informatique [Bruxelles]Department of Mathematical Sciences [Matieland, Stellenbosch Uni.]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..https://dmtcs.episciences.org/527/pdf[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| spellingShingle | Guy Louchard Helmut Prodinger Asymptotic results for silent elimination Discrete Mathematics & Theoretical Computer Science [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| title | Asymptotic results for silent elimination |
| title_full | Asymptotic results for silent elimination |
| title_fullStr | Asymptotic results for silent elimination |
| title_full_unstemmed | Asymptotic results for silent elimination |
| title_short | Asymptotic results for silent elimination |
| title_sort | asymptotic results for silent elimination |
| topic | [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| url | https://dmtcs.episciences.org/527/pdf |
| work_keys_str_mv | AT guylouchard asymptoticresultsforsilentelimination AT helmutprodinger asymptoticresultsforsilentelimination |