2011/06/23 by Joshua Cooper, Aaron Dutle, Cooper, Joshua +1 · 20 citations
Computer Science · Mathematics · #Adjacency list #Algebra over a field #Algebra representation #Combinatorics #Context (archaeology) #Discrete mathematics #Eigenvalues and eigenvectors #Graph #Graph theory #Hypergraph #Jordan algebra #Line graph #Mathematics #Matrix Theory and Algorithms #Multilinear algebra #Multilinear map #Physics #Polynomial and algebraic computation #Pure mathematics #Spectral graph theory #Spectral theory #Tensor decomposition and applications #Voltage graph #math.AC #math.CO #math.SP #msc:05C65 #msc:15A18 #msc:15A69
paper · pdf · doi:10.1016/j.laa.2011.11.018
published in Linear Algebra and its Applications 436(9), 3268-3292 (Elsevier BV) · 32 pages, no figures
arxiv created 2011/10/26 · arxiv updated 2011/10/27 · openalex publication_date 2011/12/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
We present a spectral theory of hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of "hyperdeterminants" of hypermatrices, a.k.a. multidimensional arrays. Hyperdeterminants share many properties with determinants, but the context of multilinear algebra is substantially more complicated than the linear algebra required to address Spectral Graph Theory (i.e., ordinary matrices). Nonetheless, it is possible to define eigenvalues of a hypermatrix via its characteristic polynomial as well as variationally. We apply this notion to the "adjacency hypermatrix" of a uniform hypergraph, and prove a number of natural analogues of basic results in Spectral Graph Theory. Open problems abound, and we present a number of directions for further study.