On laplacians of random complexes
Anna Gundert, Uli Wagner · 2012
Eigenvalues associated to graphs are a well-studied subject. In particular the spectra of the adjacency matrix and of the Laplacian of random graphs G(n,p) are known quite precisely. We consider generalizations of these matrices to simplicial complexes of higher dimensions and study their eigenvalues for the Linial--Meshulam model Xk(n,p) of random k-dimensional simplicial complexes on n vertices. We show that for p=Ω(log n/n), the eigenvalues of both, the higher-dimensional adjacency matrix and the Laplacian, are a.a.s.~sharply concentrated around two values.