Frequent points for random walks in two dimensions

Abstract

For a symmetric random walk in Z2 which does not necessarily have bounded jumps we study those points which are visited an unusually large number of times. We prove the analogue of the Erdos-Taylor conjecture and obtain the asymptotics for the number of visits to the most visited site. We also obtain the asymptotics for the number of points which are visited very frequently by time n. Among the tools we use are Harnack inequalities and Green's function estimates for random walks with unbounded jumps; some of these are of independent interest.

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…