|Date: Saturday, March 10, 2018
Location: 1360 East Hall (11:10 AM to 12:00 PM)
Title: Recruitment Symposium: Geometry of Expander Graphs
Abstract: Expander graphs are mathematical models of efficient networks: Namely they are finite graphs that are robust (i.e. hard to disconnect), yet sparse. As such they are very desirable and have many applications, but unfortunately, they have proven notoriously difficult to construct explicitly. We will see how the interplay between ideas from spectral geometry, representation theory, geometric group theory and dynamics have led to constructions of expander graphs with a wide range of different geometric behavior.
Speaker: Wouter Van Limbeek