Skip to main content
SpringerLink
Log in

Random Walks on Directed Covers of Graphs

  • Published:
Journal of Theoretical Probability Aims and scope Submit manuscript

Abstract

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still equals the branching number, upper and lower growth rates no longer coincide in general. Furthermore, the behavior of random walks on directed covers of infinite graphs is more subtle. We provide a classification in terms of recurrence and transience and point out that the critical random walk may be recurrent or transient. Our proof is based on the observation that recurrence of the random walk is equivalent to the almost sure extinction of an appropriate branching process. Two examples in random environment are provided: homesick random walk on infinite percolation clusters and random walk in random environment on directed covers. Furthermore, we calculate, under reasonable assumptions, the rate of escape with respect to suitable length functions and prove the existence of the asymptotic entropy providing an explicit formula which is also a new result for directed covers of finite graphs. In particular, the asymptotic entropy of random walks on directed covers of finite graphs is positive if and only if the random walk is transient.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Avez, A.: Entropie des groupes de type fini. C. R. Acad. Sci. Paris Sér. A–B 275, A1363–A1366 (1972)

    MathSciNet  Google Scholar 

  2. Benjamini, I., Peres, Y.: Tree-indexed random walks on groups and first passage percolation. Probab. Theory Relat. Fields 98(1), 91–112 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bertacchi, D., Zucca, F.: Characterization of critical values of branching random walks on weighted graphs through infinite-type branching processes. J. Stat. Phys. 134(1), 53–65 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  4. Björklund, M.: Central limit theorems for Gromov hyperbolic groups. J. Theor. Probab. doi:10.1007/s10959-009-0230-x (2009, to appear)

  5. Blachère, S., Brofferio, S.: Internal diffusion limited aggregation on discrete groups having exponential growth. Preprint available at arXiv:math/0507582v1 [math.PR] (2005)

  6. Blachère, S., Haïssinsky, P., Mathieu, P.: Asymptotic entropy and Green speed for random walks on countable groups. Ann. Probab. 36(3), 1134–1152 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cover, T., Thomas, J.: Elements of Information Theory, 2nd edn. Wiley, New York (2006)

    MATH  Google Scholar 

  8. Derriennic, Y.: Quelques applications du théorème ergodique sous-additif. Astérisque 74, 183–201 (1980)

    MATH  MathSciNet  Google Scholar 

  9. Doyle, P.G., Snell, J.L.: Random Walks and Electric Networks. Carus Mathematical Monographs, vol. 22. Mathematical Association of America, Washington (1984)

    MATH  Google Scholar 

  10. Fayolle, G., Malyshev, V.A., Menshikov, M.V.: Topics in the Constructive Theory of Countable Markov Chains. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  11. Förster, K.-H., Nagy, B.: Local spectral radii and Collatz–Wielandt numbers of monic operator polynomials with nonnegative coefficients. Linear Algebra Appl. 268, 41–57 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. Gairat, A.S., Malyshev, V.A., Menshikov, M.V., Pelikh, K.D.: Classification of Markov chains that describe the evolution of random strings. Usp. Mat. Nauk 50(2(302)), 5–24 (1995)

    MathSciNet  Google Scholar 

  13. Gantert, N., Müller, S., Popov, S., Vachkovskaia, M.: Survival of branching random walks in random environment. J. Theor. Probab. doi:10.1007/s10959-009-0227-5 (2009, to appear)

  14. Gilch, L.: Rate of escape of random walks on free products. J. Aust. Math. Soc. 83(1), 31–54 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kaimanovich, V.: Hausdorff dimension of the harmonic measure on trees. Ergod. Theory Dyn. Syst. 18, 631–660 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kaimanovich, V.A., Vershik, A.M.: Random walks on discrete groups: boundary and entropy. Ann. Probab. 11, 457–490 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  17. Lyons, R.: Random walks and percolation on trees. Ann. Probab. 18, 931–958 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  18. Lyons, R., Peres, Y.: Probability on Trees and Networks. Current version available at http://mypage.iu.edu/~rdlyons/ (2009, in preparation)

  19. Müller, S.: A criterion for transience of multidimensional branching random walk in random environment. Electron. J. Probab. 13, 1189–1202 (2008)

    MATH  MathSciNet  Google Scholar 

  20. Nagnibeda, T., Woess, W.: Random walks on trees with finitely many cone types. J. Theor. Probab. 15(2), 383–422 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  21. Schaefer, H.H.: Banach Lattices and Positive Operators. Die Grundlehren der Mathematischen Wissenschaften, Band 215. Springer, New York (1974)

    MATH  Google Scholar 

  22. Seneta, E.: Non-negative Matrices and Markov Chains. Springer Series in Statistics. Springer, New York (2006). Revised reprint of the second (1981) edition [Springer, New York; MR0719544]

    MATH  Google Scholar 

  23. Takacs, C.: Random walk on periodic trees. Electron. J. Probab. 2, 1–16 (1997)

    MathSciNet  Google Scholar 

  24. von Below, J.: An index theory for uniformly locally finite graphs. Linear Algebra Appl. 431, 1–19 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  25. Woess, W.: Random Walks on Infinite Graphs and Groups. Cambridge Tracts in Mathematics, vol. 138. Cambridge University Press, Cambridge (2000)

    Book  MATH  Google Scholar 

  26. Zeitouni, O.: Random walks in random environment. In: Lectures on Probability Theory and Statistics. Lecture Notes in Math., vol. 1837, pp. 189–312. Springer, Berlin (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematische Strukturtheorie, Graz University of Technology, Steyrergasse 30/III, 8010, Graz, Austria

    Lorenz A. Gilch & Sebastian Müller

Authors
  1. Lorenz A. Gilch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sebastian Müller
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lorenz A. Gilch.

Additional information

L.A. Gilch supported by German Research Foundation (DFG) grant GI 746/1-1.

S. Müller supported by German Research Foundation (DFG) grant MU 2868/1-1.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gilch, L.A., Müller, S. Random Walks on Directed Covers of Graphs. J Theor Probab 24, 118–149 (2011). https://doi.org/10.1007/s10959-009-0256-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10959-009-0256-0

Keywords

Mathematics Subject Classification (2000)

Search

Navigation