<p>On the trace of a discrete-time simple random walk on <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="440_2025_1441_Article_IEq1.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {Z}^d\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mrow> <mi mathvariant="double-struck">Z</mi> </mrow> <mi>d</mi> </msup> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="440_2025_1441_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="41" /> </InlineMediaObject> <EquationSource Format="TEX">\(d\ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>d</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>, we consider the evolution of favorite sites, i.e., sites that achieve the maximal local time at a certain time. For <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="440_2025_1441_Article_IEq3.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="40" /> </InlineMediaObject> <EquationSource Format="TEX">\(d=2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>d</mi> <mo>=</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>, we show that almost surely three favorite sites occur simultaneously infinitely often and eventually there is no simultaneous occurrence of four favorite sites. For <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="440_2025_1441_Article_IEq4.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="41" /> </InlineMediaObject> <EquationSource Format="TEX">\(d\ge 3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>d</mi> <mo>≥</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation>, we derive sharp asymptotics of the number of favorite sites. This answers an open question of Erdős and Révész (1984), which was brought up again by Dembo (2005).</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Favorite sites for simple random walk in two and more dimensions

  • Chenxu Hao,
  • Xinyi Li,
  • Izumi Okada,
  • Yushu Zheng

摘要

On the trace of a discrete-time simple random walk on \(\mathbb {Z}^d\) Z d for \(d\ge 2\) d 2 , we consider the evolution of favorite sites, i.e., sites that achieve the maximal local time at a certain time. For \(d=2\) d = 2 , we show that almost surely three favorite sites occur simultaneously infinitely often and eventually there is no simultaneous occurrence of four favorite sites. For \(d\ge 3\) d 3 , we derive sharp asymptotics of the number of favorite sites. This answers an open question of Erdős and Révész (1984), which was brought up again by Dembo (2005).