3 citations · 3 across the 2 of their papers we have counts for
2 papers
math-ph2022
A Metric Graph for Which the Number of Possible Endpoints of a Random Walk Grows Minimally
V. L. Chernyshev, A. 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
math.CO2021★ 3 cited
Asymptotics of the Number of Endpoints of a Random Walk on a Certain Class of Directed Metric Graphs
Vsevolod Chernyshev, Anton Tolchennikov
A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.