A model of self‐avoiding random walks for searching complex networks (Q4648693): Difference between revisions

@@ Property / cites work @@
+Lower bounds for covering times for reversible Markov chains and random walks on graphs
+Normal rank
@@ Property / cites work @@
+Short random walks on graphs
@@ Property / cites work: Short random walks on graphs / 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 @@
+Transport properties of random walks on scale-free/regular-lattice hybrid networks
+Normal rank
@@ Property / cites work @@
+A tight lower bound on the cover time for random walks on graphs
+Normal rank
@@ Property / cites work @@
+RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK
+Normal rank
@@ Property / cites work @@
+On the cover time of random walks on graphs
@@ Property / cites work: On the cover time of random walks on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4317935
@@ Property / cites work: Q4317935 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4341806
@@ Property / cites work: Q4341806 / rank @@
+Normal rank
@@ Property / cites work @@
+Know thy neighbor's neighbor
@@ Property / cites work: Know thy neighbor's neighbor / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Performance of random walks in one-hop replication networks
+Normal rank
@@ Property / cites work @@
+The diffusion of self-avoiding random walk in high dimensions
+Normal rank
@@ Property / cites work @@
+A Technique for Lower Bounding the Cover Time
@@ Property / cites work: A Technique for Lower Bounding the Cover Time / rank @@
+Normal rank