Scaling limit of the collision measures of multiple random walks

Abstract

For an integer k 2, let S(1), S(2), …, S(k) be k independent simple symmetric random walks on Z. A pair (n,z) is called a collision event if there are at least two distinct random walks, namely, S(i),S(j) satisfying S(i)n= S(j)n=z. We show that under the same scaling as in Donsker's theorem, the sequence of random measures representing these collision events converges to a non-trivial random measure on [0,1]× R. Moreover, the limit random measure can be characterized using Wiener chaos. The proof is inspired by methods from statistical mechanics, especially, by a partition function that has been developed for the study of directed polymers in random environments.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…