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

DOI10.1134/S1061920821040038MaRDI QIDQ825082zbMATH OpenFDO

Authors Vsevolod L. Chernyshev, Anton A. Tolchennikov

Publication date 17 December 2021

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

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)

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.

Cites work

• Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree
• Introduction to quantum graphs
• Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph
• Statistics of Gaussian packets on metric and decorated graphs
• 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)