Guy Louchard ; Helmut Prodinger - Asymptotic results for silent elimination

dmtcs:527 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, Vol. 12 no. 2 -
Asymptotic results for silent eliminationArticle

Authors: Guy Louchard 1; Helmut Prodinger 2

  • 1 D├ępartement d'Informatique [Bruxelles]
  • 2 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..

Volume: Vol. 12 no. 2
Published on: January 1, 2010
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

1 Document citing this article

Consultation statistics

This page has been seen 287 times.
This article's PDF has been downloaded 380 times.