Skip to main content
SpringerLink
Log in

An Inaccessible Graph

  • Conference paper
  • First Online:
Random Walks, Boundaries and Spectra

Part of the book series: Progress in Probability ((PRPR,volume 64))

Abstract

An inaccessible, vertex transitive, locally finite graph is described. This graph is not quasi-isometric to a Cayley graph.

Mathematics Subject Classification (2000). Primary 05C63; Secondary 05E18.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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. M.R. Bridson and A. Haefliger, Metric spaces of non-positive curvature. Springer 1999.

    MATH  Google Scholar 

  2. Warren Dicks and M.J. Dunwoody, Groups acting on graphs, Cambridge University Press, 1989.

    Google Scholar 

  3. R. Diestel and I. Leader, A conjecture concerning a limit of non-Cayley graphs. J. Algebraic Combin. 14 (2001) 17–25.

    Article  MathSciNet  MATH  Google Scholar 

  4. M.J. Dunwoody, The accessibility of finitely presented groups, Invent. Math. 81 (1985) 449–457.

    Article  MathSciNet  MATH  Google Scholar 

  5. M.J.Dunwoody, An inaccessible group, in: Geometric Group Theory Vol. 1 (ed. G.A. Niblo and M.A. Roller) LMS Lecture Notes 181 (1993) 75–78.

    Google Scholar 

  6. M.J. Dunwoody, Inaccessible groups and protrees, J. Pure Appl. Alg. 88 (1993) 63–78. [7] M.J. Dunwoody and J.M. Jones, A group with strange decomposition properties, J. Graph Theory 1 (1998) 301–305.

    Google Scholar 

  7. M.J. Dunwoody and J.M. Jones, A group with very strange decomposition properties, J. Austral. Math. Soc. 67 (1999) 185–190.

    Article  MathSciNet  MATH  Google Scholar 

  8. M.J. Dunwoody, Folding sequences. In The Epstein birthday schrift, pages 139–158 (electronic). Geom. Topol., Coventry, 1998.

    Google Scholar 

  9. M.J. Dunwoody and B. Kr¨on, Vertex cuts, arXiv:0905.0064.

    Google Scholar 

  10. A. Eskin, D. Fisher, K. Whyte, Coarse differentiation of quasi-isometries I: spaces not quasi-isometric to Cayley graphs. arXiv math/0607207.

    Google Scholar 

  11. A. Eskin, D. Fisher, K. Whyte, Coarse differentiation of quasi-isometries II: spaces not quasi-isometric to Cayley graphs. arXiv math/0706.0940.

    Google Scholar 

  12. P.A. Linnell, On accessiblility of groups. J. Pure appl. Algebra 30 (1983) 39–46.

    Article  MathSciNet  MATH  Google Scholar 

  13. J.R. Stallings, Group theory and three-dimensional manifolds, Yale University Press (1971).

    Google Scholar 

  14. P.M. Soardi and W. Woess, Amenability, unimodularity, and the spectral radius of random walks on infinite graphs. Math. Z. 205 (1990), 471–486.

    Article  MathSciNet  MATH  Google Scholar 

  15. C. Thomassen and W. Woess, Vertex-transitive graphs and accessibility, J. of Comb Theory, Series B 58 (1991) 248–268.

    Google Scholar 

  16. W. Woess, Topological groups and infinite graphs. Directions in infinite graph theory and combinatorics, (Cambridge, 1989). Discrete Math. 95 (1991), 373–384.

    Google Scholar 

  17. W. Woess Lamplighters, Diestel-Leader graphs, random walks, and harmonic functions, Combinatorics, Probability and Computing 14 (2005) 415–433.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Southampton, Southampton, SO16 7GR, UK

    M. J. Dunwoody

Authors
  1. M. J. Dunwoody
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. J. Dunwoody .

Editor information

Editors and Affiliations

  1. Mathematisches Inst., Universität Jena, Ernst-Abbe-Platz 2, Jena, 07737, Germany

    Daniel Lenz

  2. Inst. Mathematik C, TU Graz, Steyrergasse 30, Graz, 8010, Austria

    Florian Sobieczky

  3. Inst. Mathematik C, TU Graz, Steyrergasse 30, Graz, 8010, Austria

    Wolfgang Woess

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Basel AG

About this paper

Cite this paper

Dunwoody, M.J. (2011). An Inaccessible Graph. In: Lenz, D., Sobieczky, F., Woess, W. (eds) Random Walks, Boundaries and Spectra. Progress in Probability, vol 64. Springer, Basel. https://doi.org/10.1007/978-3-0346-0244-0_1

Download citation

Publish with us

Policies and ethics

Search

Navigation