Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-01182961
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 6, 2015 - 10:35:02 AM
Last modification on : Friday, March 9, 2018 - 3:34:56 PM
Long-term archiving on: : Friday, May 5, 2017 - 1:21:04 PM

File

dmAA0114.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01182961, version 1

Collections

Citation

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. ⟨hal-01182961⟩

Share

Metrics

Record views

122

Files downloads

603