Spectra of uniform hypergraphs

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

Authors: Joshua Cooper, Aaron Dutle 

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

• Spectral properties of general hypergraphs
• On spectral hypergraph theory of the adjacency tensor
• Some spectral properties of uniform hypergraphs
• Adjacency spectra of random and complete hypergraphs
• Some upper bounds on the eigenvalues of uniform hypergraphs

zbMATH Keywords

spectrumcharacteristic polynomialhypergraphresultant

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Hypergraphs (05C65)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Eigenvalues of a real supersymmetric tensor
• Title not available (Why is that?)
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Perron-Frobenius theorem for nonnegative tensors
• A generalization of the Motzkin-Straus theorem to hypergraphs
• Recent results in the theory of graph spectra
• On the second eigenvalue of hypergraphs
• Algebraic connectivity of an even uniform hypergraph
• Weak quasi-randomness for uniform hypergraphs
• On Unicursal Paths in a Network of Degree 4
• Title not available (Why is that?)
• Spectra of hypergraphs and applications
• Laplacian eigenvalues and partition problems in hypergraphs
• Title not available (Why is that?)
• Hypergraphs, quasi-randomness, and conditions for regularity
• A new 5‐arc‐transitive cubic graph
• Analogue of the identity Log Det = Trace Log for resultants
• The Eigenvalues of a Graph and Its Chromatic Number

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

• Outer and \((b,c)\) inverses of tensors
• Lower bounds for the \(\mathcal{A}_\alpha\)-spectral radius of uniform hypergraphs
• Principal eigenvector of the signless Laplacian matrix
• Some properties of the signless Laplacian and normalized Laplacian tensors of general hypergraphs
• The adjacency and signless Laplacian spectra of cored hypergraphs and power hypergraphs
• Largest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges (vertices)
• Spectra of cycle and path families of oriented hypergraphs
• The signless Laplacian matrix of hypergraphs
• Spectral radius on linear \(r\)-graphs without expanded \(K_{r+1}\)
• Eigenvalue bounds of third-order tensors via the minimax eigenvalue of symmetric matrices
• On the first and second eigenvalue of finite and infinite uniform hypergraphs
• The matching polynomials and spectral radii of uniform supertrees
• Symmetry of eigenvalues of Sylvester matrices and tensors
• A preconditioned tensor splitting iteration method and associated global correction technique for solving multilinear systems
• Sharp bounds for the spectral radii of nonnegative tensors
• Some properties on \(\alpha\)-least eigenvalue of uniform hypergraphs and their applications
• On the \(\alpha \)-spectra of uniform hypergraphs and its associated graphs
• Extension of Moore–Penrose inverse of tensor via Einstein product
• Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems
• The largest spectral radius of uniform hypertrees with a given size of matching
• A general result on the spectral radii of nonnegative \(k\)-uniform tensors
• \((\alpha,\beta)\)-labelling method for \(k\)-uniform hypergraph and its applications
• Algebraic degree of spectra of Cayley hypergraphs
• Adjacency energy of hypergraphs
• The smallest spectral radius of bicyclic uniform hypergraphs with a given size
• On some properties of the \(\alpha \)-spectral radius of the \(k\)-uniform hypergraph
• Uniform supertrees with extremal spectral radii
• Uniform hypergraphs with the first two smallest spectral radii
• Sharp bounds for spectral radius of nonnegative weakly irreducible tensors
• Applications of the Harary-Sachs theorem for hypergraphs
• The weighted hypergraph with the maximum spectral radius
• Numerical study on Moore-Penrose inverse of tensors via Einstein product
• Adjacency spectra of random and complete hypergraphs
• Principal eigenvectors of general hypergraphs
• Spectral extremal results for hypergraphs
• Simplifying the computation of the spectrum of the complete \(k\)-uniform hypergraph
• The spectral radius and domination number in linear uniform hypergraphs
• Some bounds for the incidence \(Q\)-spectral radius of uniform hypergraphs
• Relating hypergraph parameters of generalized power graphs
• Computing all Laplacian H-eigenvalues for a uniform loose path of length three
• A homogeneous polynomial associated with general hypergraphs and its applications
• The effect on the spectral radius of \(r\)-graphs by grafting or contracting edges
• The maximum spectral radius of uniform hypergraphs with given number of pendant edges
• The geometry connectivity of hypergraphs
• High-order copositive tensors and its applications
• The first few unicyclic and bicyclic hypergraphs with largest spectral radii
• The (signless Laplacian) spectral radius (of subgraphs) of uniform hypergraphs
• The first two largest spectral radii of uniform supertrees with given diameter
• The maximum \(\alpha\)-spectral radius of unicyclic hypergraphs with fixed diameter
• The characteristic polynomial of the complete 3-uniform hypergraph
• The minimum spectral radius of the \(r\)-uniform supertree having two vertices of maximum degree
• The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge
• On the conjecture of the \(r\)-uniform supertrees with the eight largest \(\alpha\)-spectral radii
• On extremal spectral radii of uniform supertrees with given independence number
• The maximum \(\alpha \)-spectral radius and the majorization theorem of \(k\)-uniform supertrees
• The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number
• The maximum spectral radius ofk-uniform hypergraphs withrpendent vertices
• E-cospectral hypergraphs and some hypergraphs determined by their spectra
• On some properties of the determinants of tensors
• The \(H\)-spectra of a class of generalized power hypergraphs
• Connected hypergraphs with small spectral radius
• Maximizing spectral radii of uniform hypergraphs with few edges
• Analytic connectivity of \(k\)-uniform hypergraphs
• Spectral radii of two kinds of uniform hypergraphs
• The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
• Tensor join of hypergraphs and its spectra
• A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
• Characterizations of the spectral radius of nonnegative weakly irreducible tensors via a digraph
• Computing tensor eigenvalues via homotopy methods
• Symmetric nonnegative tensors and copositive tensors
• On spectral hypergraph theory of the adjacency tensor
• The \(\alpha \)-spectral radius of general hypergraphs
• Hypergraph characterizations of copositive tensors
• Signed \(k\)-uniform hypergraphs and tensors
• Computing extreme eigenvalues of large scale Hankel tensors
• Spectrum of mixed bi-uniform hypergraphs
• Some properties of the p-spectral radius on tensors for general hypergraphs and their applications
• Primitive tensors and directed hypergraphs
• The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs
• Some spectral properties of uniform hypergraphs
• Spectra of general hypergraphs
• The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
• On the spectrum and linear programming bound for hypergraphs
• A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor
• Eigenvalues and linear quasirandom hypergraphs
• Generalized tensor eigenvalue problems
• Extremal problems for the \(p\)-spectral radius of Berge hypergraphs
• Analytic methods for uniform hypergraphs
• Eigenvariety of nonnegative symmetric weakly irreducible tensors associated with spectral radius and its application to hypergraphs
• The extremal spectral radii of \(k\)-uniform supertrees
• The extremal \(p\)-spectral radius of Berge hypergraphs
• The Laplacian tensor of a multi-hypergraph
• Spectral hypergraph theory of the adjacency hypermatrix and matroids
• Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
• On the principal eigenvectors of uniform hypergraphs
• Brauer-type eigenvalue inclusion sets and the spectral radius of tensors
• Some upper bounds on the eigenvalues of uniform hypergraphs
• A survey on the spectral theory of nonnegative tensors.
• Some properties of the spectral radius for general hypergraphs
• The eigenvectors to the \(p\)-spectral radius of general hypergraphs

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)