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

From MaRDI portal
Publication:265646

DOI10.1016/J.SPA.2015.11.008zbMATH Open1335.60071arXiv1409.8368OpenAlexW1652335846MaRDI QIDQ265646FDOQ265646


Authors: Izumi Okada Edit this on Wikidata


Publication date: 4 April 2016

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1409.8368




Recommendations




Cites Work


Cited In (5)





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)