Spectra of uniform hypergraphs

From MaRDI portal
Publication:417456

DOI10.1016/J.LAA.2011.11.018zbMATH Open1238.05183arXiv1106.4856OpenAlexW2964074814MaRDI QIDQ417456FDOQ417456


Authors: Joshua Cooper, Aaron Dutle Edit this on Wikidata


Publication date: 14 May 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1106.4856




Recommendations




Cites Work


Cited In (only showing first 100 items - show all)





This page was built for publication: Spectra of uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417456)