Aleliunas, R., Karp, R., Lipton, R., Lovász, L. and Rackoff, C. (1979) Random walks, universal traversal sequences, and the complexity of maze traversal. In Proc. 20th IEEE Symposium on the Foundations of Computer Science, pp. 218–233.
Barlow, M. T., Pitman, J. W. and Yor, M. (1989) On Walsh's Brownian motions. Séminaire de Probabilités (Strasbourg) 23 275–293.
Baxter, J. R. and Chacon, R. V. (1984) The equivalence of diffusions on networks to Brownian motion. Contemp. Math. 26 33–47.
Brightwell, G. R. and Winkler, P. (1990) Extremal cover time for random walks on trees. J. Graph Theory 14 547–554.
Brightwell, G. R. and Winkler, P. (1990) Maximum hitting time for random walks on graphs. Random Struct. Alg. 1 263–276.
Broder, A. (1990) Universal sequences and graph cover times: A short survey. In Sequences, Springer, pp. 109–122.
Chandra, A. K., Raghavan, P., Ruzzo, W. L., Smolensky, R. and Tiwari, P. (1989) The electrical resistance of a graph captures its commute and cover times. In Proc. 21st ACM Symposium on the Theory of Computing, pp. 574–586.
Dembo, A., Peres, Y., Rosen, J. and Zeitouni, O. (2004) Cover times for Brownian motion and random walks in two dimensions. Ann. of Math. 160 433–464.
Ding, G., Lee, J. and Peres, Y. (2012) Cover times, blanket times, and majorizing measures. Ann. of Math. 175 1409–1471.
Doyle, P. and Snell, J. L. (1984) Random Walks and Electrical Networks, Mathematical Association of America.
Feige, U. (1995) A tight upper bound on the cover time for random walks on graphs. Random Struct. Alg. 6 51–54.
Frank, H. F. and Durham, S. (1984) Random motion on binary trees. J. Appl. Probab. 21 58–69.
Georgakopoulos, A. (2010) Uniqueness of electrical currents in a network of finite total resistance. J. London Math. Soc. 82 256–272.
Georgakopoulos, A. (2011) Graph topologies induced by edge lengths. In Infinite Graphs: Introductions, Connections, Surveys, special issue of Discrete Math. 311 1523–1542.
Georgakopoulos, A. (2013) On graph-like continua of finite length. Preprint.
Georgakopoulos, A. and Kolesko, K. (2013) Brownian motion on graph-like spaces. Preprint.
Kahn, J. D., Linial, N., Nisan, N. and Saks, M. E. (1989) On the cover time of random walks on graphs. J. Theoret. Probab. 2 121–128.
Karlin, A. and Raghavan, P. (1995) Random walks and undirected graph connectivity: A survey. In Discrete Probability and Algorithms, Vol. 72 of The IMA Volumes in Mathematics and its Applications, Springer, pp. 95–101.
Kigami, J. (2008) Analysis on Fractals, Cambridge University Press.
Lyons, R. with Peres, Y.Probability on Trees and Networks, Cambridge University Press, to appear.
Mihail, M. and Papadimitriou, C. (1994) On the random walk method for protocol testing. In Computer Aided Verification, Vol. 818 of Lecture Notes in Computer Science, Springer, pp. 132–141.
Mörters, P. and Peres, Y. (2010) Brownian Motion, Cambridge University Press.
Tetali, P. (1991) Random walks and the effective resistance of networks. J. Theoret. Probab. 4 101–109.
Thomassen, C. and Vella, A. (2008) Graph-like continua, augmenting arcs, and Menger's theorem. Combinatorica 28 595–623.
Varopoulos, N. T. (1985) Long range estimations for Markov chains. Bull. Sci. Math. 109 225–252.
Wald, A. (1944) On cumulative sums of random variables. Ann. Math. Statist. 15 283–296.
Walsh, J. (1978) A diffusion with discontinuous local time. Temps Locaux, Astérisque 52/5337–45.
Winkler, P. and Zuckerman, D. (1996) Multiple cover time. Random Struct. Alg. 9 403–411.
Zuckerman, D. (1989) Covering times of random walks on bounded-degree trees and other graphs. J. Theoret. Probab. 2 147–157.
Zuckerman, D. (1991) On the time to traverse all edges of a graph. Inform. Process. Lett. 38 335–337.