3 citations · 4 across the 4 of their papers we have counts for
Showing math-phShow all
2 papers · 1 filter
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-ph2021★ 1 cited
Asymptotics of the number of possible endpoints of a random walk on a directed Hamiltonian metric graph
Daniil Pyatko, Vsevolod Chernyshev
In this paper, the leading term of the asymptotics of the number of possible final positions of a random walk on a directed Hamiltonian metric graph is found. Consideration of such…