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

DOI10.1134/S0001434623030252MaRDI QIDQ2699793

D. V. Pyat'ko, Vsevolod L. Chernyshev

Publication date: 19 April 2023

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

dynamical systemdirected graphcounting functionBernoulli-Barnes polynomial

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Combinatorial dynamics (types of periodic orbits) (37E15) Eulerian and Hamiltonian graphs (05C45) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Asymptotics of the number of endpoints of a random walk on a certain class of directed metric 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
• Statistics of Gaussian packets on metric and decorated graphs

This page was built for publication: Asymptotics of the number of end positions of a random walk on a directed Hamiltonian metric graph