A sharp estimate for cover times on binary trees (Q424523): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Nicko G. Gamkrelidze / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C81 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 60C05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6040315 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cover time | |||
| Property / zbMATH Keywords: cover time / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
random walk | |||
| Property / zbMATH Keywords: random walk / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Gaussian free field | |||
| Property / zbMATH Keywords: Gaussian free field / rank | |||
Normal rank | |||
Revision as of 22:27, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sharp estimate for cover times on binary trees |
scientific article |
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
