Tensor Entropy for Uniform Hypergraphs

In this paper, we develop the notion of entropy for uniform hypergraphs. Hypergraphs are generalized from graphs based on tensor theory. We employ the probability distribution of the generalized singular values, calculated from the higher-order singular value decomposition of the Laplacian tensors, to fit into the Shannon entropy formula. We show that this tensor entropy is an extension of von Neumann entropy for graphs. In addition, we establish results on the lower and upper bounds of the entropy and demonstrate that it is a measure of regularity for uniform hypergraphs in simulated and experimental data. Finally, we exploit the tensor train decomposition in computing the proposed tensor entropy efficiently.