A tight upper bound on the cover time for random walks on graphs (Q4322474): Difference between revisions

@@ Property / author @@
-Uriel Feige
@@ Property / author: Uriel Feige / rank @@
-Normal rank
@@ Property / author @@
+Uriel Feige
@@ Property / author: Uriel Feige / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/rsa.3240060106
+Normal rank
@@ Property / OpenAlex ID @@
+W4230376356
@@ Property / OpenAlex ID: W4230376356 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum hitting time for random walks on graphs
@@ Property / cites work: Maximum hitting time for random walks on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The electrical resistance of a graph captures its commute and cover times
+Normal rank
@@ Property / cites work @@
+Collisions Among Random Walks on a Graph
@@ Property / cites work: Collisions Among Random Walks on a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Random walks and the effective resistance of networks
+Normal rank