Spectra of general hypergraphs

Abstract

Here, we show a method to reconstruct connectivity hypermatrices of a general hypergraph (without any self loop or multiple edge) using tensor. We also study the different spectral properties of these hypermatrices and find that these properties are similar for graphs and uniform hypergraphs. The representation of a connectivity hypermatrix that is proposed here can be very useful for the further development in spectral hypergraph theory.

This paper is already online available at Linear algebra and its application

References in corpus (1)

• The Eigenvectors of the Zero Laplacian and Signless Laplacian Eigenvalues of a Uniform Hypergraph

Cited by in corpus (19)

• Signal Processing on Higher-Order Networks: Livin' on the Edge ... and Beyond
• Introducing Hypergraph Signal Processing: Theoretical Foundation and Practical Applications
• Hypergraph Spectral Analysis and Processing in 3D Point Cloud
• Vector Centrality in Hypergraphs
• Controllability of Hypergraphs
• An Efficient Hypergraph Approach to Robust Point Cloud Resampling
• The Signless Laplacian Matrix of Hypergraphs
• Point Cloud Resampling Through Hypergraph Signal Processing
• On Some General Operators of Hypergraphs
• Hypergraph Dissimilarity Measures
• Point Cloud Segmentation based on Hypergraph Spectral Clustering
• Uplifting edges in higher order networks: spectral centralities for non-uniform hypergraphs
• Principal eigenvectors of general hypergraphs
• Spectral bounds for non-uniform hypergraphs using weighted clique expansion
• Regularized Recovery by Multi-order Partial Hypergraph Total Variation
• On the Incidence matrices of hypergraphs
• Spectral theory of weighted hypergraphs via tensors
• HyperLearn: A Distributed Approach for Representation Learning in Datasets With Many Modalities
• The bounds of the spectral radius of general hypergraphs in terms of clique number