University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Property (T) and expanders, a-T-menability and median graphs/cut metrics

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Property (T) and expanders, a-T-menability and median graphs/cut metrics

Download to your calendar using vCal

  • UserCornelia Drutu Badea (University of Oxford)
  • ClockFriday 25 July 2025, 09:30-10:30
  • HouseExternal.

If you have a question about this talk, please contact nobody.

OGGW05 - Geometric and combinatorial methods in the foundations of computer science and artificial intelligence

This talk will overview two opposite properties of infinite groups and their connections to  two families of graphs. More precisely, property (T) relates to expander graphs (robust networks) in many ways, while a-T-menability is closely connected with median graphs (economic networks), and more generally cut metrics.   This latter connection turns out to be fruitful, for instance in the solution of the Goemans-Linial conjecture (relevant in the Sparsest Cut Problem with general demands) using the geometry of Heisenberg groups.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Engineering Department Energy, Fluids and Thermo seminars Robinson College Quantum Information

Other talks

Studying viruses to understand what makes pandemic viruses special and how innate immunity works Precarity and the economy of makeshifts: A novel argument from the census of England, 1851-1911 Title tbc Using A Function-Centric Lens to Re-consider Regularisation, Representation Transfer and Geometric Properties of Neural Networks Climate, uncertainty, and the slippery measurement of Antarctic ice Group Presentation 1
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity