4 citations · 10 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 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.
How the permutation of edges of a metric graph affects the number of points moving along the edges
V. L. Chernyshev, A. A. Tolchennikov
We consider a dynamical system on a metric graph, that corresponds to a semiclassical solution of a time-dependent Schrödinger equation. We omit all details concerning mathematical…
Asymptotic estimate for the number of Gaussian packets on three decorated graphs
V. L. Chernyshev, A. A. Tolchennikov
We study a topological space obtained from a graph via replacing vertices with smooth Riemannian manifolds, i.e. a decorated graph. We construct a semiclassical asymptotics of the…