pith. sign in

arxiv: 1507.03805 · v2 · pith:DQ7MMW4Mnew · submitted 2015-07-14 · 🧮 math.PR

The asymptotics of group Russian roulette

classification 🧮 math.PR
keywords chimedeadeveryonegroupproblemrouletterussiansurvivors
0
0 comments X
read the original abstract

We study the group Russian roulette problem, also known as the shooting problem, defined as follows. We have $n$ 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 $p_n$ of having no survivors does not converge as $n\to\infty$, and becomes asymptotically periodic and continuous on the $\log n$ scale, with period 1.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.