Poissonization-based collision threshold derivation for random walks on lattices
Abstract
In this expository note, we give a short derivation of the expected number of collisions between two independent simple random walkers on integer lattices. Adapting a Poissonization technique introduced by Lange, we express the collision probability as the return probability of the continuous-time difference walk, given by a modified Bessel function. Analyzing its asymptotic decay yields a clean, self-contained proof that the expected number of collisions in Zd is finite if and only if d≥3. We also provide a general formula for the asymptotic number of collisions.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.