A Metric Graph for Which the Number of Possible Endpoints of a Random Walk Grows Minimally
arXiv:2212.06941 · doi:10.1134/S1061920822040033
Abstract
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