A Sequential Search Distribution: Proofreading, Russian Roulette, and the Incomplete q-Eulerian Polynomials - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2001

A Sequential Search Distribution: Proofreading, Russian Roulette, and the Incomplete q-Eulerian Polynomials

Abstract

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.
Fichier principal
Vignette du fichier
dmAA0114.pdf (103.05 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01182961 , version 1 (06-08-2015)

Identifiers

Cite

Travis Herbranson, Don Rawlings. A Sequential Search Distribution: Proofreading, Russian Roulette, and the Incomplete q-Eulerian Polynomials. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. pp.193-202, ⟨10.46298/dmtcs.2281⟩. ⟨hal-01182961⟩

Collections

INSMI TDS-MACS
70 View
579 Download

Altmetric

Share

Gmail Facebook X LinkedIn More