On spectral hypergraph theory of the adjacency tensor
Kelly J. Pearson, Tan Zhang

TL;DR
This paper explores the spectral properties of the adjacency tensor of uniform hypergraphs, focusing on eigenvalues, eigenvectors, and symmetry conditions, advancing hypergraph spectral theory.
Contribution
It provides new conditions linking eigenvalues to positive eigenvectors and characterizes symmetry in the E-spectrum of adjacency tensors.
Findings
Largest positive H or Z-eigenvalue has a positive eigenvector under certain conditions
Conditions for symmetry in the E-spectrum of the adjacency tensor
Insights into spectral properties of uniform hypergraph adjacency tensors
Abstract
We study both and -eigenvalues of the adjacency tensor of a uniform multi-hypergraph and give conditions for which the largest positive or -eigenvalue corresponds to a strictly positive eigenvector. We also investigate when the -spectrum of the adjacency tensor is symmetric.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Advanced Neuroimaging Techniques and Applications
