Skip to main content

A Note on Recurrence, Amenability, and the Universal Cover of Graphs

  • Conference paper
Random Discrete Structures

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 76))

  • 534 Accesses

Abstract

Given a regular graph G, and its unversal covering tree T, we give conditions which relate recurrence and amenability of G to the size of a certain subset R of the Martin boundary of T. In particular, G is recurrent if and only if R has full harmonic measure; G is amenable if and only if R has full Hausdorff demension.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aldous, D. Personal Communication, 1990.

    Google Scholar 

  2. Bougerol, P. and Elie, L., Existence of positive harmonic functions on groups and on covering manifolds, prépublication # 198 du Laboratoire de Probabilités de l’Université Paris VI, 1993.

    Google Scholar 

  3. Cartier, P. Functions Harmoniques sur un Arbre, Symposia Mathematica 9(1972), 203–270.

    Google Scholar 

  4. Dodziuk, J. Difference Equations, Isoperimetric Inequality, and Transience of Certain Random Walks. Trans. Amer. Math. Soc. 284 (1984), 787–794.

    Article  MathSciNet  MATH  Google Scholar 

  5. Dodziuk, J. and Karp, L. Spectral and function theory of combinational Laplacians, Contemp. Math. vol. 73, Amer. Math. Soc, Providence, RI (1986), 25–40.

    Google Scholar 

  6. Falconer, K.J., The Geometry of Fractal Sets, Cambridge University Press, Cambridge, 1985.

    Book  MATH  Google Scholar 

  7. Gerl, P. Amenable Groups and Amenable Graphs. Lecture Notes in Mathematics 1359 (1988), 181–190.

    Article  MathSciNet  Google Scholar 

  8. Kesten, H., Full Banach mean values on countable groups. Math. Scand. 7 (1959), 146–156.

    MathSciNet  MATH  Google Scholar 

  9. Kemeny, J.G., Snell, J.L., and Knapp, A.W., Denumerable Markov Chains, van Nostrand, Princeton, 1966.

    MATH  Google Scholar 

  10. Lyons, R. Random Walks and Percolation on Trees. Ann. Probab. 18 (1990), 931–968.

    Article  MathSciNet  MATH  Google Scholar 

  11. Lyons, T. and Sullivan D., Function theory, random paths and covering spaces, J. Differential Geom. 19 (1984), 299–323.

    MathSciNet  MATH  Google Scholar 

  12. Nicholls, P.J., The Ergodic Theory of Discrete Groups, Cambridge University Press, Cambridge, 1989.

    Book  MATH  Google Scholar 

  13. Northshield, S., Geodesics and bounded harmonic functions on infinite planar graphs, Proc. Amer. Math. Soc, 113 #1 (1991), 229–233.

    Article  MathSciNet  MATH  Google Scholar 

  14. Northshield, S., Cogrowth of Regular Graphs, Proc Amer. Math. Soc, 116 #1 (1992), 203–205.

    Article  MathSciNet  MATH  Google Scholar 

  15. Northshield, S., Amenability and superharmonic functions, Proc Amer. Math. Soc, 119 #2 (1993), 561–566.

    Article  MathSciNet  MATH  Google Scholar 

  16. Paterson, A., Amenability, AMS, Providence, RI, 1988.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Northshield, S. (1996). A Note on Recurrence, Amenability, and the Universal Cover of Graphs. In: Aldous, D., Pemantle, R. (eds) Random Discrete Structures. The IMA Volumes in Mathematics and its Applications, vol 76. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0719-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-0719-1_13

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-6881-9

  • Online ISBN: 978-1-4612-0719-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics