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

DOI10.1134/S1061920821040038zbMath1479.05328arXiv2101.04184MaRDI QIDQ825082

Anton A. Tolchennikov, Vsevolod L. Chernyshev

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

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

Related Items (1)

Asymptotics of the number of end positions of a random walk on a directed Hamiltonian metric graph

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
• Statistics of Gaussian packets on metric and decorated graphs
• Unnamed Item

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