Author:
Beveridge Andrew,Youngblood Jeanmarie
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. Aldous, D., Fill, J.: Reversible Markov chains and random walks on graphs. http://www.stat.berkeley.edu/~aldous/RWG/book.html . Accessed Jan 2014
2. Aldous, D., Lovász, L., Winkler, P.: Mixing times for uniformly ergodic Markov chains. Stoch. Process. Appl. 71, 165–185 (1997)
3. Beveridge, A.: Centers for random walks on trees. SIAM J. Discrete Math. 23(1), 300–318 (2009)
4. Beveridge, A., Wang, M.: Mixing times for random walks on trees. Graph Combin. 29(4), 757–772 (2013)
5. Brightwell, G., Winkler, P.: Maximum hitting time for random walks on graphs. In: Proceedings of 22nd ACM Symposium on Theory of Computing, pp. 369–378 (1990)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献