3 citations · 4 across the 4 of their papers we have counts for
4 papers
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
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…
Asymptotics of the number of waves on rational polyhedra
Vsevolod L. Chernyshev, Alexey Rukhovich
The problem of counting the number of waves arriving at the vertex of a polyhedron is motivated by physics. In the article it was solved for the case of Platonic solid using three…
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.