The hitting and cover times of random walks on finite graphs using local degree information (Q1001905): Difference between revisions

@@ Property / cites work @@
+On the time taken by random walks on finite groups to visit every state
+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 @@
+Q2921765
@@ Property / cites work: Q2921765 / rank @@
+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 @@
+A tight upper bound on the cover time for random walks on graphs
+Normal rank
@@ Property / cites work @@
+A tight lower bound on the cover time for random walks on graphs
+Normal rank
@@ Property / cites work @@
+Q4449241
@@ Property / cites work: Q4449241 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Cover Time for Random Walks on Random Graphs
+Normal rank
@@ Property / cites work @@
+Covering problems for Markov chains
@@ Property / cites work: Covering problems for Markov chains / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+On a Result of Aleliunas <i>et al.</i> Concerning Random Walks on Graphs
+Normal rank