The distribution for the number of searches needed to find k of n lost objects is expressed in terms of a refinement of the q-Eulerian polynomials, for which formulae are developed involving homogeneous symmetric polynomials. In the case when k=n and the find probability remains constant, relatively simple and efficient formulas are obtained.From our main theorem, we further (1) deduce the inverse absorption distribution and (2) determine the expected number of times the survivor pulls the trigger in an n-player game of Russian roulette.
Publié le : 2001-07-04
Classification:
California Polytechnic State University,
San Luis Obispo,
California 93407,
[INFO]Computer Science [cs],
[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG],
[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM],
[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
@article{hal-01182961,
author = {Herbranson, Travis and Rawlings, Don},
title = {A Sequential Search Distribution: Proofreading, Russian Roulette, and the Incomplete q-Eulerian Polynomials},
journal = {HAL},
volume = {2001},
number = {0},
year = {2001},
language = {en},
url = {http://dml.mathdoc.fr/item/hal-01182961}
}
Herbranson, Travis; Rawlings, Don. A Sequential Search Distribution: Proofreading, Russian Roulette, and the Incomplete q-Eulerian Polynomials. HAL, Tome 2001 (2001) no. 0, . http://gdmltest.u-ga.fr/item/hal-01182961/