Kikuchi Graphs: A Spectral Method for Hypergraphs @SimonsInstitute
Kikuchi Graphs: A Spectral Method for Hypergraphs  @SimonsInstitute
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.
Kikuchi Graphs: A Spectral Method for HypergraphsA survey on PIT for read-once algebraic branching programsNew directions in catalytic derandomizationPolar Codes IFourier quasicrystals from stable polynomials and beyondAlgebraic Geometry and Discrete Periodic OperatorsFinite free information inequalitiesToward Provably Private Federated LearningCompressed timestamps and efficient random walks in catalytic spaceRandom unitary circuits with constant spectral gapFrom local discrete curvature notions of graphs to global properties of the underlying spacesProperty (T), sums of square and numerical certificates
Simons Institute for the Theory of Computing |

Kikuchi Graphs: A Spectral Method for Hypergraphs

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER