On the cover time of random walks on graphs (Q1823548): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Jeffry Kahn / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Michael E. Saks / rank | |||
Normal rank | |||
Revision as of 05:47, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the cover time of random walks on graphs |
scientific article |
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
