Skip to main content
Log in

The Einstein Relation for Random Walks on Graphs

  • Published:
Journal of Statistical Physics Aims and scope Submit manuscript

A Correction to this article was published on 23 November 2023

This article has been updated

Abstract

This paper investigates the Einstein relation; the connection between the volume growth, the resistance growth and the expected time a random walk needs to leave a ball on a weighted graph. The Einstein relation is proved under different set of conditions. In the simplest case it is shown under the volume doubling and time comparison principles. This and the other set of conditions provide the basic framework for the study of (sub-) diffusive behavior of the random walks on weighted graphs.

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

Access this article

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

Instant access to the full article PDF.

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Change history

References

  1. S. Alexander, and R. Orbach, Density of states on fractals,“fractions,” J. Physique (Paris) Lett. 43: L625–L631 (1982).

    Google Scholar 

  2. M. T. Barlow, Which values of the volume growth and escape time exponent are possible for a graph?, Revista Math. Iberoamericana 20: 1–31(2004).

    MATH  MathSciNet  Google Scholar 

  3. M. T. Barlow, Some remarks on the elliptic Harnack inequality, to appear in Bull. London. Math. Soc.

  4. M. T. Barlow, Diffusion on Fractals, in:“Lectures on Probability Theory and Statistics, Ecole d’ été de Probabilités de Saint-flour XXV -1995”, Lecture Notes Math. 1690, Springer 1–121 (1998)

  5. M. T. Barlow, and R. Bass, Stability of the parabolic Harnack inequalities, Trans. Amer. Math. Soc., 356(4): 1501–1533 (2003).

    MathSciNet  Google Scholar 

  6. T. Coulhon and A. Grigor’ yan, Random walks on graphs with regular volume growth. Geom. Funct. Anal. 8(4), 656–701 (1998).

    Article  MathSciNet  Google Scholar 

  7. A. Einstein, Über die von der molekulakinetishen Theorie der Wärme gefoderte Bewegung von in ruhenden flüssigkeite suspendierten Teilchen. Annalen der Physik 17: (1905).

  8. A. Grigor’ yan, and A. Telcs, Sub-Gaussian estimates of heat kernels on infinite graphs, Duke Math. J., 109(3): 452–510 (2001).

    MathSciNet  Google Scholar 

  9. A. Grigor’ yan, and A. Telcs, Harnack inequalities and sub-Gaussian estimates for random walks, Math. Ann. 324: 521–556 (2002).

    MathSciNet  Google Scholar 

  10. B.M. Hambly, and T. Kumgai, Heat kernel estimates for symmetric randomwalks on a class of fractal graphs and stability under rough isometries, Proc. of Symposia in Pure Math. 72, Part 2, pp. 233–260, Amer. Math. Soc. (2004).

  11. B. D. Hughes, Random Walks and Random Environments, Random Environments, Clarendon Press Vol. 2 1996.

  12. P. Li, and J. Wang, Mean value inequalities, Indiana Univ. Math., J., 48(4): 1257–1283 (1999).

  13. A. Telcs, Random Walks on Graphs, Electric Networks and Fractals. Probab. Theory Related. Fields 82: 435–449 (1989).

  14. A. Telcs, Local Sub-Gaussian Estimates on Graphs: The Strongly Recurrent Case, Electronic Journal of Probability, 22(6): 1–33 (2001).

    Google Scholar 

  15. A. Telcs, Volume and time doubling of graphs and random walk, the strongly recurrent case, Communication on Pure and Applied Mathematics, LIV 975–1018 (2001).

  16. A. Telcs, Random walks on graphs with volume and time doubling, submitted.

  17. A. Telcs, Random walk on weakly homogeneous graphs, in preparation.

  18. W. Woess, Random walks on infinite graphs and groups, Cambridge University Press, Cambridge, (2000).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to András Telcs.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Telcs, A. The Einstein Relation for Random Walks on Graphs. J Stat Phys 122, 617–645 (2006). https://doi.org/10.1007/s10955-005-8002-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10955-005-8002-1

Key Words

Navigation