Maximal Entropy Random Walks in \(\mathbb {Z}\): Random and Non-Random Environments
摘要
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