A metric graph for which the number of possible end positions of a random walk grows minimally (Q2701431)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7680925
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A metric graph for which the number of possible end positions of a random walk grows minimally |
scientific article; zbMATH DE number 7680925 |
Statements
A metric graph for which the number of possible end positions of a random walk grows minimally (English)
0 references
28 April 2023
0 references
0 references
0 references
0.721662700176239
0 references
0.717732846736908
0 references
0.7018293142318726
0 references
0.7004680633544922
0 references
