A metric graph for which the number of possible end positions of a random walk grows minimally
From MaRDI portal
Publication:2701431
DOI10.1134/S1061920822040033MaRDI QIDQ2701431
Vsevolod L. Chernyshev, Anton A. Tolchennikov
Publication date: 28 April 2023
Published in: Russian Journal of Mathematical Physics (Search for Journal in Brave)
Cites Work
- Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree
- Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph
- The second term in the asymptotics for the number of points moving along a metric graph
- Behavior of quasi-particles on hybrid spaces. Relations to the geometry of geodesics and to the problems of analytic number theory
- Statistics of Gaussian packets on metric and decorated graphs
This page was built for publication: A metric graph for which the number of possible end positions of a random walk grows minimally