Asymptotics of the number of endpoints of a random walk on a certain class of directed metric graphs

DOI10.1134/S1061920821040038zbMATH Open1479.05328arXiv2101.04184MaRDI QIDQ825082FDOQ825082

Authors: Vsevolod L. Chernyshev, Anton A. Tolchennikov 

Publication date: 17 December 2021

Published in: Russian Journal of Mathematical Physics (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/2101.04184

zbMATH Keywords

directed strongly connected metric graphone-way Sperner graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Distance in graphs (05C12) Random walks on graphs (05C81)

Cites Work

• Introduction to quantum graphs
• Statistics of Gaussian packets on metric and decorated graphs
• 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

Cited In (3)

• Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree
• Convergence towards the end space for random walks on Schreier graphs
• Asymptotics of the number of end positions of a random walk on a directed Hamiltonian metric graph

This page was built for publication: Asymptotics of the number of endpoints of a random walk on a certain class of directed metric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q825082)