An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs
Journal of the ACM (JACM)
Markov incremental constructions
Proceedings of the twenty-fourth annual symposium on Computational geometry
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Probabilistic Multiagent Patrolling
SBIA '08 Proceedings of the 19th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
A pursuer-evader game for sensor networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
| Hi-index | 0.00 |
The short-term behavior of random walks on graphs is studied, in particular, the rate at which a random walk discovers new vertices and edges. A conjecture by Linial that the expected time to find $\cal N$ distinct vertices is $O({\cal N}^{3})$ is proved. In addition, upper bounds of $O({\cal M}^{2})$ on the expected time to traverse $\cal M$ edges and of $O(\cal M \cal N)$ on the expected time to either visit $\cal N$ vertices or traverse $\cal M$ edges (whichever comes first) are proved.