Combinatorial Laplacian and entropy of simplicial complexes associated with complex networks
Institute of Nuclear Sciences Vinča, University of Belgrade, PO Box 522, 11001 Belgrade, Serbia
Revised: 23 July 2012
Published online: 17 September 2012
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.
© EDP Sciences, Springer-Verlag, 2012