Uploaded October 2026 | Updated November 2026, 4 days ago
Tim Hsieh (MIT)
https://simons.berkeley.edu/talks/tim-hsieh-mit-2026-10-12
Probabilistic Phenomena on Graphs, Groups, and Manifolds
In this talk, I will discuss spectral methods for studying hypergraphs. I will introduce the Kikuchi graph, a construction that turns a k-uniform hypergraph into an ordinary graph. Studying the spectral properties of such graphs has led to several surprising applications. I will focus on two of them: the hypergraph Moore bound, and lower bounds for locally decodable codes.
Tim Hsieh (MIT)
https://simons.berkeley.edu/talks/tim-hsieh-mit-2026-10-12
Probabilistic Phenomena on Graphs, Groups, and Manifolds
In this talk, I will discuss spectral methods for studying hypergraphs. I will introduce the Kikuchi graph, a construction that turns a k-uniform hypergraph into an ordinary graph. Studying the spectral properties of such graphs has led to several surprising applications. I will focus on two of them: the hypergraph Moore bound, and lower bounds for locally decodable codes.










