Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph
type: Item
instance of: scholarly article
title: Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph
zbMATH Open document ID: 1460.05178
publication date: 2019-04-29T00:00:00Z
Mathematics Subject Classification ID: 05C81
Mathematics Subject Classification ID: 05C31
zbMATH DE Number: 7048648
zbMATH Keywords: metric graphs
zbMATH Keywords: graph polynomials
zbMATH Keywords: Barnes' multiple Bernoulli polynomials
zbMATH Keywords: random walks on graphs
author: Vsevolod L. Chernyshev
author: Anton A. Tolchennikov
MaRDI profile type: Publication
full work available at URL: j.endm.2018.11.005
OpenAlex ID: W2904313105
cites work: Statistics of Gaussian packets on metric and decorated graphs
cites work: Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree
cites work: The second term in the asymptotics for the number of points moving along a metric graph
cites work: The Lattice Points of Tetrahedra
cites work: Integer points in polyhedra
cites work: Q5704414
cites work: Construction of the paths of Brownian motions on star graphs. I
DOI: 10.1016/J.ENDM.2018.11.005
description: scientific article; zbMATH DE number 7048648