A sharp estimate for cover times on binary trees (Q424523)
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 6040315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sharp estimate for cover times on binary trees |
scientific article; zbMATH DE number 6040315 |
Statements
A sharp estimate for cover times on binary trees (English)
0 references
1 June 2012
0 references
The paper deals with a cover time of a random walk on a graph. The cover time of a random walk on a graph, which is the time it takes the walk to visit every vertex in the graph is a basic parameter. The authors compute the second order correction for cover time of the binary tre of depth \(n\) (continuous time) random walk and show that the second order correction differs from corresponding one for the maximum of the Gaussian free field on the tree.
0 references
cover time
0 references
random walk
0 references
Gaussian free field
0 references
0 references
0 references
0 references
0.8405847549438477
0 references
0.8282729387283325
0 references
0.8186238408088684
0 references
0.8127790093421936
0 references
0.8021624088287354
0 references
