{"docId":527,"paperId":527,"url":"https:\/\/dmtcs.episciences.org\/527","doi":"10.46298\/dmtcs.527","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":89,"name":"Vol. 12 no. 2"}],"section":[],"repositoryName":"Hal","repositoryIdentifier":"hal-00994591","repositoryVersion":1,"repositoryLink":"https:\/\/hal.science\/hal-00994591v1","dateSubmitted":"2015-03-26 16:21:21","dateAccepted":"2015-06-09 14:47:54","datePublished":"2010-01-01 08:00:00","titles":{"en":"Asymptotic results for silent elimination"},"authors":["Louchard, Guy","Prodinger, Helmut"],"abstracts":{"en":"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]"]}