Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph

DOI10.1016/j.endm.2018.11.005zbMath1460.05178OpenAlexW2904313105MaRDI QIDQ1739922

Anton A. Tolchennikov, Vsevolod L. Chernyshev

Publication date: 29 April 2019

Full work available at URL: https://doi.org/10.1016/j.endm.2018.11.005

zbMATH Keywords

Barnes' multiple Bernoulli polynomialsrandom walks on graphsmetric graphsgraph polynomials

Mathematics Subject Classification ID

Graph polynomials (05C31) Random walks on graphs (05C81)

Related Items (5)

Asymptotics of the number of endpoints of a random walk on a certain class of directed metric graphs ⋮ Restricted partitions: the polynomial case ⋮ Asymptotics of the number of end positions of a random walk on a directed Hamiltonian metric graph ⋮ A metric graph for which the number of possible end positions of a random walk grows minimally ⋮ The number of endpoints of a random walk on a semi-infinite metric path graph

Cites Work

• Unnamed Item
• Unnamed Item
• Integer points in polyhedra
• Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree
• 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
• The Lattice Points of Tetrahedra

This page was built for publication: Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph