Starting from the definition of hyper adjacency matrix, Eq. (REF ), the notion of (combinatorial) Laplace matrix for networks can be straightforwardly generalised to the case of hypergraphs [1]}, [2]}, by defining \(k_i\delta _{ij}-A_{ij}\) , where \(k_i=\sum _j A_{ij}\) .
Let us however observe that the latter does not account in full for the higher-order structures encoded in the hypergraph. Notably, the sizes of the incident hyperedges are neglected.
