Abstract
This paper complements the analysis of Louchard and Prodinger [LP08] on the number of rounds in a coin-flipping selection algorithm that occurs in the presence of a demon. We precisely analyze a very different aspect of the selection algorithm, using different methods of analysis. Specifically, we obtain precise descriptions of the distribution and all moments of the number of participants ultimately selected during the execution of the algorithm. The selection algorithm is robust in at least two significant ways. The presence of a demon allows for the precise analysis even when errors may occur between the rounds of the selection process. (The analysis also handles the more traditional case, in which no demon is involved.) The selection algorithm can also use either biased or unbiased coins.
Similar content being viewed by others
References
P. Flajolet and R. Sedgewick, Mellin transforms and asymptotics: Finite differences and Rice’s integrals, Theoret. Comput. Sci., 144 (1995), 101–124.
P. Flajolet and R. Sedgewick, Analytic Combinatorics, Cambridge, 2009.
M. Loève, Probability Theory (2 volumes), 4th edition, Springer, New York, 1977, 1978.
G. Louchard and H. Prodinger, Advancing in the presence of a demon, Math. Slovaca, 58 (2008), 263–276.
W. Szpankowski, Average Case Analysis of Algorithms on Sequences, Wiley, New York, 2001.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Bálint Tóth
Rights and permissions
About this article
Cite this article
Louchard, G., Prodinger, H. & Ward, M.D. Number of survivors in the presence of a demon. Period Math Hung 64, 101–117 (2012). https://doi.org/10.1007/s10998-012-9101-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10998-012-9101-9