On the cover time of random walks on graphs (Q1823548)
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 4115669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the cover time of random walks on graphs |
scientific article; zbMATH DE number 4115669 |
Statements
On the cover time of random walks on graphs (English)
0 references
1989
0 references
random walks on arbitrary graphs
0 references
expected time needed for a randm walk on a finite graph to visit
0 references
every vertex
0 references
expected time needed for a randm walk on a finite graph to visit every vertex
0 references
0.8996298909187317
0 references
0.8937816023826599
0 references
0.8859221339225769
0 references
0.8778620958328247
0 references
0.87178635597229
0 references
