A Metric Graph for Which the Number of Possible Endpoints of a Random Walk Grows Minimally
V. L. Chernyshev, A. A. Tolchennikov·2022-12-14·via math.CO updates on arXiv.org
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