We study the entropy of the distribution of the set $R_n$ of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of $R_n$ if the graph is uniformly transient, and sublinearly in the expected size if the graph is uniformly recurrent with subexponential volume growth. This in particular answers a question asked by Benjamini, Kozma, Yadin and Yehudayoff (preprint).
References
I. Benjamini, G. Kozma, A. Yadin, A. Yehudayoff. Entropy of random walk range. Ann. Inst. H. Poincaré Probab. Statist., to appear. 1208.82046 10.1214/09-AIHP345 euclid.aihp/1288878339I. Benjamini, G. Kozma, A. Yadin, A. Yehudayoff. Entropy of random walk range. Ann. Inst. H. Poincaré Probab. Statist., to appear. 1208.82046 10.1214/09-AIHP345 euclid.aihp/1288878339
T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein. Introduction to algorithms. (second edition) MIT Press, Cambridge, MA, 2001. 1047.68161T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein. Introduction to algorithms. (second edition) MIT Press, Cambridge, MA, 2001. 1047.68161
T.M. Cover, J.A. Thomas. Elements of information theory. John Wiley & Sons, Inc., New York, 1991. 0762.94001T.M. Cover, J.A. Thomas. Elements of information theory. John Wiley & Sons, Inc., New York, 1991. 0762.94001
R. Durrett. Probability: Theory and Examples. (third edition) Brooks/Cole, Belmont, 2005. 1202.60002R. Durrett. Probability: Theory and Examples. (third edition) Brooks/Cole, Belmont, 2005. 1202.60002
A. Erschler. On drift and entropy growth for random walks on groups. Ann. Probab. 31/3, pp. 1193-1204, 2003. 1043.60005 10.1214/aop/1055425775 euclid.aop/1055425775A. Erschler. On drift and entropy growth for random walks on groups. Ann. Probab. 31/3, pp. 1193-1204, 2003. 1043.60005 10.1214/aop/1055425775 euclid.aop/1055425775
V.A. Kaimanovich, A.M. Vershik. Random walks on discrete groups: boundary and entropy. Ann. Probab., 11/3, pp. 457-490, 1983. 0641.60009 10.1214/aop/1176993497 euclid.aop/1176993497V.A. Kaimanovich, A.M. Vershik. Random walks on discrete groups: boundary and entropy. Ann. Probab., 11/3, pp. 457-490, 1983. 0641.60009 10.1214/aop/1176993497 euclid.aop/1176993497
A. Naor, Y. Peres. Embeddings of discrete groups and the speed of random walks. International Mathematics Research Notices 2008, Art. ID rnn 076. 1163.46007 10.1093/imrn/rnn076A. Naor, Y. Peres. Embeddings of discrete groups and the speed of random walks. International Mathematics Research Notices 2008, Art. ID rnn 076. 1163.46007 10.1093/imrn/rnn076
C.E. Shannon. A mathematical theory of communication. The Bell System Technical Journal, Vol. 27, pp. 379-423, 623-656, 1948. 1154.94303 10.1002/j.1538-7305.1948.tb01338.xC.E. Shannon. A mathematical theory of communication. The Bell System Technical Journal, Vol. 27, pp. 379-423, 623-656, 1948. 1154.94303 10.1002/j.1538-7305.1948.tb01338.x
N.T. Varopoulos. Long range estimates for Markov chains. Bull. Sci. Math. (2) 109, pp. 225-252, 1985. 0583.60063N.T. Varopoulos. Long range estimates for Markov chains. Bull. Sci. Math. (2) 109, pp. 225-252, 1985. 0583.60063
W. Woess. Random walks on infinite graphs and groups. Cambridge University Press, Cambridge, 2000. 0951.60002W. Woess. Random walks on infinite graphs and groups. Cambridge University Press, Cambridge, 2000. 0951.60002
