A tight upper bound on the cover time for random walks on graphs (Q4322474): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/rsa.3240060106 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4230376356 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum hitting time for random walks on graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The electrical resistance of a graph captures its commute and cover times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Collisions Among Random Walks on a Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random walks and the effective resistance of networks / rank | |||
Normal rank | |||
Latest revision as of 10:51, 23 May 2024
scientific article; zbMATH DE number 720955
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight upper bound on the cover time for random walks on graphs |
scientific article; zbMATH DE number 720955 |
Statements
A tight upper bound on the cover time for random walks on graphs (English)
0 references
19 April 1995
0 references
random walks on graphs
0 references
hitting time
0 references
