arXiv Analytics

Sign in

arXiv:1007.4870 [math.CO]AbstractReferencesReviewsResources

(Very) short proof of Rayleigh's Theorem (and extensions)

Olivier Bernardi

Published 2010-07-28, updated 2012-06-12Version 3

Consider a walk in the plane made of $n$ unit steps, with directions chosen independently and uniformly at random at each step. Rayleigh's theorem asserts that the probability for such a walk to end at a distance less than 1 from its starting point is $1/(n+1)$. We give an elementary proof of this result. We also prove the following generalization valid for any probability distribution $\mu$ on the positive real numbers: if two walkers start at the same point and make respectively $m$ and $n$ independent steps with uniformly random directions and with lengths chosen according to $\mu$, then the probability that the first walker ends farther than the second is $m/(m+n)$.

Related articles: Most relevant | Search more
arXiv:1312.4350 [math.CO] (Published 2013-12-16)
Extensions of rich words
arXiv:2301.12964 [math.CO] (Published 2023-01-30)
Some extensions of Delete Nim
arXiv:0911.2809 [math.CO] (Published 2009-11-14, updated 2012-03-06)
A short proof of the tree-packing theorem