Combinatorial Laplacian and entropy of simplicial complexes associated with complex networks
Simplicial complexes represent useful and accurate models of complex networks and complex systems in general. We explore the properties of spectra of combinatorial Laplacian operator of simplicial complexes and show its relationship with connectivity properties of the Q-vector and with connectivities of cliques in the simplicial clique complex. We demonstrate the need for higher order analysis in complex networks and compare the results with ordinary graph spectra. Methods and results are obtained using social network of the Zachary karate club.