1. D. Aldous, J. Fill, Reversible Markov chains and random walks on graphs. Unpublished. http://stat-www.berkeley.edu/users/aldous/RWG/book.html, 1997
2. Lower bounds for covering times for reversible Markov chains and random walks on graphs;Aldous;J. Theoret. Probab.,1989
3. Random walks, universal traversal sequences, and the complexity of maze problems;Aleliunas,1979
4. C. Avin, C. Brito, Efficient and robust query processing in dynamic environments using random walk techniques, in: Proc. of the Third International Symposium on Information Processing in Sensor Networks, 2004, pp. 277–286
5. C. Avin, G. Ercal, Bounds on the mixing time and partial cover of ad-hoc and sensor networks, in: Proceedings of the 2nd European Workshop on Wireless Sensor Networks, EWSN 2005, 2005, pp. 1–12