Frequently visited sites of the inner boundary of simple random walk range

preprint2016arXivOpen access

Abstract

This paper considers the question: how many times does a simple random walk revisit the most frequently visited site among the inner boundary points? It is known that in Z2{\mathbb{Z}}^2, the number of visits to the most frequently visited site among all of the points of the random walk range up to time nn is asymptotic to π−1(log⁡n)2π^{-1}(\log n)^2, while in Zd{\mathbb{Z}}^d (d≥3)(d\ge3), it is of order log⁡n\log n. We prove that the corresponding number for the inner boundary is asymptotic to βdlog⁡nβ_d\log n for any d≥2d\ge2, where βdβ_d is a certain constant having a simple probabilistic expression.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.