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

DOI10.1016/J.ENDM.2018.11.005zbMATH Open1460.05178OpenAlexW2904313105MaRDI QIDQ1739922FDOQ1739922

Authors: Vsevolod L. Chernyshev, Anton A. Tolchennikov 

Publication date: 29 April 2019

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

zbMATH Keywords

metric graphsgraph polynomialsrandom walks on graphsBarnes' multiple Bernoulli polynomials

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Lattice Points of Tetrahedra
• Integer points in polyhedra
• 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
• The second term in the asymptotics for the number of points moving along a metric graph
• Construction of the paths of Brownian motions on star graphs. I

Cited In (5)

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

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

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