Corpus ID: 17730699

Kazhdan's Property (T) for Graphs

  title={Kazhdan's Property (T) for Graphs},
  author={C. Brasseur and Ryan E. Grady and S. Prassidis},
  journal={arXiv: Combinatorics},
  • C. Brasseur, Ryan E. Grady, S. Prassidis
  • Published 2006
  • Mathematics
  • arXiv: Combinatorics
  • D. A. Kahzdan first put forth property (T) in relation to the study of discrete subgroups of Lie groups of finite co-volume. Through a combinatorial approach, we define an analogue of property (T) for regular graphs. We then prove the basic combinatorial and metric properties of Kazhdan groups in this context. In particular, we use our methods to construct infinite families of expanders as in the classical case. Finally, we consider the combinatorial analogue of the group theoretic property… CONTINUE READING


    Publications referenced by this paper.
    Discrete groups, expanding graphs and invariant measures
    • 409
    • Highly Influential
    • Open Access
    Spectral interpretations of property (T )
    • 2
    • Highly Influential
    • Open Access
    Roundness Properties of Groups
    • 20
    • Open Access
    A Conjecture Concerning a Limit of Non-Cayley Graphs
    • 76
    • Open Access
    Topics in Geometric Group Theory
    • 578
    Generalized roundness and negative type.
    • 44
    • Open Access
    RANDOM WALKS ON INFINITE GRAPHS AND GROUPS (Cambridge Tracts in Mathematics 138)
    • 284
    • Highly Influential