<p>The Maximal Entropy Random Walk (MERW) is a natural process on a finite graph, introduced a few years ago with motivations from theoretical physics. The construction of this process relies on Perron-Frobenius theory for adjacency matrices. Generalizing to infinite graphs is rather delicate, and in this article, we study in detail specific models of the MERW on <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10955_2025_3516_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {Z}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">Z</mi> </math></EquationSource> </InlineEquation> with loops, for both random and non-random loops. Thanks to an explicit combinatorial representation of the corresponding Perron-Frobenius eigenvectors, we are able to precisely determine the asymptotic behavior of these walks. We show, in particular, that essentially all MERWs on <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10955_2025_3516_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {Z}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">Z</mi> </math></EquationSource> </InlineEquation> with loops have positive speed.</p>

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

Maximal Entropy Random Walks in \(\mathbb {Z}\): Random and Non-Random Environments

  • Thibaut Duboux,
  • Lucas Gerin,
  • Yoann Offret

摘要

The Maximal Entropy Random Walk (MERW) is a natural process on a finite graph, introduced a few years ago with motivations from theoretical physics. The construction of this process relies on Perron-Frobenius theory for adjacency matrices. Generalizing to infinite graphs is rather delicate, and in this article, we study in detail specific models of the MERW on \(\mathbb {Z}\) Z with loops, for both random and non-random loops. Thanks to an explicit combinatorial representation of the corresponding Perron-Frobenius eigenvectors, we are able to precisely determine the asymptotic behavior of these walks. We show, in particular, that essentially all MERWs on \(\mathbb {Z}\) Z with loops have positive speed.