Author:
Ikeda Satoshi,Kubo Izumi,Yamashita Masafumi
Subject
General Computer Science,Theoretical Computer Science
Reference19 articles.
1. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász, C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in: Proc. 20th Ann. Symposium on Foundations of Computer Science, 1979, pp. 218–223
2. On the time taken by random walks on finite groups to visit every state;Aldous;Z. Wahrsch. verw. Gebiete,1983
3. D.J. Aldous, J. Fill, Reversible Markov Chains and Random Walks on Graphs. http://www.stat.berkeley.edu/users/aldous/RWG/book.html
4. Maximum hitting time for random walks on graphs;Brightwell;Journal of Random Structures and Algorithms,1990
5. A.Z. Broder, Karlin, Bounds on covering times, in: Proc. 29th Annual Symposium on Foundations of Computer science, 1988, pp. 479–487
Cited by
53 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On cover times of Markov chains;Stochastic Models;2024-03-12
2. Reversing Inhomogeneous and Imprecise Markov Chains;Advances in Intelligent Systems and Computing;2024
3. Reversible random walks on dynamic graphs;Random Structures & Algorithms;2023-06-21
4. Hitting times for random walks on tricyclic graphs;AKCE International Journal of Graphs and Combinatorics;2023-01-02
5. Dumbbell Graphs with Extremal (Reverse) Cover Cost;Bulletin of the Malaysian Mathematical Sciences Society;2022-11-29