Probability Seminar: Higher-dimensional expansion of random geometric complexes

Probability Seminar: Higher-dimensional expansion of random geometric complexes

Probability Seminar
Feb 1, 2023, 03:10 PM - 04:00 PM | 340 Evans Hall | Happening As Scheduled
Tselil Schramm, Stanford University

A graph is said to be a (1-dimensional) expander if the second eigenvalue of its adjacency matrix is bounded away from 1, or almost-equivalently, if it has no sparse vertex cuts. There are several natural ways to generalize the notion of expansion to hypergraphs/simplicial complexes, but one such way is 2-dimensional spectral expansion, in which the expansion of vertex neighborhoods (remarkably)...