A Metric Graph for Which the Number of Possible Endpoints of a Random Walk Grows Minimally
V. L. ChernyshevA. A. Tolchennikov
所有作者
V. L. ChernyshevA. A. Tolchennikov
文献摘要
We prove that metric graph with the minimal growth of the number of possible endpoints of a random walk is the union of several linear paths coming out of the same vertex