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 , the number of visits to the most frequently visited site among all of the points of the random walk range up to time is asymptotic to , while in , it is of order . We prove that the corresponding number for the inner boundary is asymptotic to for any , where is a certain constant having a simple probabilistic expression.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.