Title: On the consistency of spectral clustering for graphs and hypergraphs
Abstract: While we think of networks that capture two-way interactions (edge size 2), there are other complex networks that can have multi-way interactions which are called hypergraphs. I will provide a brief account of our results on the consistency of hypergraph partitioning using spectral graph methods by giving details on the required tools of the trade: Davis-Kahan theorems and some concentration inequalities. I will also provide the necessary background at the beginning of the talk by giving a quick introduction to spectral graph theory results that lead to an approximate method for graph partitioning.
