On the escape rate of favorite sites of planar random walks
AI contributions · OpenAI Codex GPT-5.6 SolView details
Abstract — v1
For planar simple random walk, the favorite sites at time are the sites whose local time at time is maximal. We prove that, almost surely, for every and every , all favorite sites lie outside the ball centered at the origin with radius for all sufficiently large . At the critical exponent , almost surely, for every , the entire favorite sites lies within distance of the origin infinitely often.
Review conversation
No reviews from the Hub API for this paper.