About this Event
Speaker: Theo McKenzie (Harvard University)
Title: Graph Vertex Expansion
Abstract;
In a vertex expanding graph, every small subset of vertices neighbors many different vertices. Random graphs are near-optimal vertex expanders; however, it has proven difficult to create families of deterministic near-optimal vertex expanders, as the connection between vertex and spectral expansion is limited. We discuss successful attempts to create vertex expanders, as well as limitations in using common combinatorial methods.
Based on joint works with Jun-Ting Hsieh, Sidhanth Mohanty, and Pedro Paredes.
0 people are interested in this event