Jaelin Kim (Renyi Institute)
Abstract: In the finite graph, the maximal entropy random walk is well understood. In the ergodic-theoretic view point, it is the invariant measure of maximal entropy of the subshift of finite type over vertex set, induced by adjacency matrix. In this talk, we will introduce a generalization of MERW on infinite graphs, which we call a uniform random walk. By observing its behavior on graphs with weighted loops, we will see it gives meaningful notion even in the transient case.