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

From MaRDI portal
(Redirected from Publication:265646)




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 mathbbZ2, the number of visits to the most frequently visited site among all of the points of the random walk range up to time n is asymptotic to pi1(logn)2, while in mathbbZd (dge3), it is of order logn. We prove that the corresponding number for the inner boundary is asymptotic to for any dge2, where is a certain constant having a simple probabilistic expression.









This page was built for publication: Frequently visited sites of the inner boundary of simple random walk range

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265646)