Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph (Q1739922): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2018.11.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2904313105 / rank | |||
Normal rank | |||
Revision as of 20:18, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph |
scientific article |
Statements
Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph (English)
0 references
29 April 2019
0 references
metric graphs
0 references
graph polynomials
0 references
Barnes' multiple Bernoulli polynomials
0 references
random walks on graphs
0 references
