Skip to main content
Log in

Random walks on graphs with a strong isoperimetric property

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

Abstract

A random walk on a graph is a Markov chain whose state space consists of the vertices of the graph and where transitions are only allowed along the edges. We study (strongly) reversible random walks and characterize the class of graphs where then-step transition probabilities tend to zero exponentially fast (δgeometric ergodicity”). These characterizations deal with an isoperimetric property, norm inequalities for certain associated operators, and eigenvalues of the Laplace operator. There is some (strong) similarity with the theory of (non)amenable groups.

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.

Similar content being viewed by others

References

  1. Biggs, N. L., Mohar, B., and Shawe-Taylor, J. (1986). The Spectral Radius of Infinite Graphs, Preprint 174 (Univ. Ljubljana).

  2. Brooks, R. (1985). The spectral geometry of the Apollonian packing,Commun. Pure Appl. Math. 38, 357–366.

    Google Scholar 

  3. Dodziuk, J. (1984). Difference equations, isoperimetric inequality and transience of certain random walks,Trans. Am. Math. Soc. 284, 787–794.

    Google Scholar 

  4. Dunford, N., and Schwartz, J. T. (1967).Linear Operators, Part I, Interscience, New York.

    Google Scholar 

  5. Gerl, P. (1973). Probability measures on semigroups,Proc. Am. Math. Soc. 40, 527–532.

    Google Scholar 

  6. Gerl, P. (1986). Random walks on graphs. InProbability Measures on Groups VIII, Heyer, H. (ed.), Lecture Notes in Math. 1210, Springer-Verlag, Berlin, pp. 285–303.

    Google Scholar 

  7. Gerl, P. (1986) Eine isoperimetrische Eigenschaft von Bäumen,Sitzungsber.Österr. Akad. Wiss. 195, Abt. II, 49–52.

    Google Scholar 

  8. Gerl, P., and Woess, W. (1986). Simple random walks on trees.Eur. J. Combinatorics,7, 321–331.

    Google Scholar 

  9. Pier, J. P., (1984).Amenable Locally Compact Groups, Wiley, New York.

    Google Scholar 

  10. Seneta, E. (1981).Non-negative Matrices and Markov Chains, 2nd ed., Springer-Verlag, New York.

    Google Scholar 

  11. Varopoulos, N. Th. (1985). Isoperimetric inequalities and Markov chains,J. Funct. Anal. 63, 215–239.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gerl, P. Random walks on graphs with a strong isoperimetric property. J Theor Probab 1, 171–187 (1988). https://doi.org/10.1007/BF01046933

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01046933

Key Words

Navigation