The asymptotics of group Russian roulette
Tim van de Brug, Wouter Kager, Ronald Meester

TL;DR
This paper analyzes the asymptotic behavior of the group Russian roulette problem, revealing that the probability of no survivors oscillates periodically with respect to the logarithm of the initial number of people, rather than converging.
Contribution
It proves that the probability of no survivors does not converge but exhibits asymptotic periodicity and continuity on the log scale, a novel insight into the problem's long-term behavior.
Findings
Probability $p_n$ does not converge as $n o
$ $p_n$ is asymptotically periodic on the $\log n$ scale
The behavior is continuous with period 1 in the log scale
Abstract
We study the group Russian roulette problem, also known as the shooting problem, defined as follows. We have armed people in a room. At each chime of a clock, everyone shoots a random other person. The persons shot fall dead and the survivors shoot again at the next chime. Eventually, either everyone is dead or there is a single survivor. We prove that the probability of having no survivors does not converge as , and becomes asymptotically periodic and continuous on the scale, with period 1.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Mathematical Dynamics and Fractals · Analytic Number Theory Research
