Covering times of random walks on bounded degree trees and other graphs (Q582702)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Covering times of random walks on bounded degree trees and other graphs |
scientific article; zbMATH DE number 4131388
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covering times of random walks on bounded degree trees and other graphs |
scientific article; zbMATH DE number 4131388 |
Statements
Covering times of random walks on bounded degree trees and other graphs (English)
0 references
1989
0 references
Upper and lower bounds are given for the expected length of a random walk that is performed on a tree until it is covered.
0 references
covering times
0 references
trees
0 references
random walk
0 references
