Bounds on expected hitting times for a random walk on a connected graph (Q922556)
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 4168721
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds on expected hitting times for a random walk on a connected graph |
scientific article; zbMATH DE number 4168721 |
Statements
Bounds on expected hitting times for a random walk on a connected graph (English)
0 references
1990
0 references
random walk
0 references
connected graph
0 references
maximum expected number of steps to get from one vertex to another
0 references
expected hitting times
0 references
0.9173312187194824
0 references
0.8387267589569092
0 references
0.8238720297813416
0 references
0.8151053786277771
0 references
0.8067712187767029
0 references
