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)

• A combinatorial method for computing characteristic polynomials of starlike hypergraphs
• Expansion in matrix-weighted graphs
• Networks beyond pairwise interactions: structure and dynamics
• Spectra of weighted uniform hypertrees
• Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue
• Spectra, Euclidean representations and clusterings of hypergraphs
• A trust region algorithm for computing extreme eigenvalues of tensors
• Spectral radius of \(r\)-uniform supertrees with perfect matchings
• The Drazin inverse of an even-order tensor and its application to singular tensor equations
• Joins of hypergraphs and their spectra
• On adjacency and e-adjacency in general hypergraphs: towards a new e-adjacency tensor
• A bound on the spectral radius of hypergraphs with \(e\) edges
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications
• Inverse Perron values and connectivity of a uniform hypergraph
• The maximum spectral radii of uniform supertrees with given degree sequences
• A sharp upper bound on the spectral radius of a nonnegative \(k\)-uniform tensor and its applications to (directed) hypergraphs
• On the irregularity of uniform hypergraphs
• On the irregularity of uniform hypergraphs
• The Fiedler vector of a Laplacian tensor for hypergraph partitioning
• On the \(\alpha \)-spectral radius of uniform hypergraphs
• On computing minimal \(H\)-eigenvalue of sign-structured tensors
• Ordering uniform supertrees by their spectral radii
• Spectral radius of uniform hypergraphs and degree sequences
• Weighted Moore-Penrose inverses and fundamental theorem of even-order tensors with Einstein product
• Largest \(H\)-eigenvalue of uniform \(s\)-hypertrees
• Continuation methods for computing Z-/H-eigenpairs of nonnegative tensors
• Principal eigenvectors and spectral radii of uniform hypergraphs
• On the \(\alpha\)-spectral radius of irregular uniform hypergraphs
• Non-uniform hypergraphs
• Alternating iterative methods for solving tensor equations with applications
• Spectral radius and matching number of the unicyclic hypergraph
• The dimension of eigenvariety of nonnegative tensors associated with spectral radius
• Geometry of the copositive tensor cone and its dual
• On the spectral radius of uniform weighted hypergraph
• On the adjacency spectra of hypertrees
• Combinatorial methods for the spectral \(p\)-norm of hypermatrices
• Some inequalities for the Hadamard product of tensors
• Generalizing \(p\)-Laplacian: spectral hypergraph theory and a partitioning algorithm
• Spectra of hyperstars
• The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
• Bounds on the spectral radius of uniform hypergraphs
• Computing eigenvalues of large scale sparse tensors arising from a hypergraph
• Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor
• Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
• On the spectral radius of uniform hypertrees
• Spectral radius of \(\{0,1\}\)-tensor with prescribed number of ones
• Tensor logarithmic norm and its applications.
• Lower bounds for the Laplacian spectral radius of an oriented hypergraph
• The spectra of uniform hypertrees
• Hypergraph Laplacians in Diffusion Framework
• Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices
• Energies of hypergraphs
• Generalized inverses of tensors via a general product of tensors
• Spectral directed hypergraph theory via tensors
• On \(P\)-unique hypergraphs
• A Harary-Sachs theorem for hypergraphs
• Sharp bounds for the signless Laplacian spectral radius of uniform hypergraphs
• Further results on Cauchy tensors and Hankel tensors
• Brauer-type upper bounds for \(Z\)-spectral radius of weakly symmetric nonnegative tensors
• Computing tensor generalized inverses via specialization and rationalization
• On a relationship between Cayley graphs and \(G\)-graphs with some applications
• Column sufficient tensors and tensor complementarity problems
• Laplacian and signless Laplacian Z-eigenvalues of uniform hypergraphs
• Largest adjacency, signless Laplacian, and Laplacian H-eigenvalues of loose paths
• On the spectral radii and principal eigenvectors of uniform hypergraphs
• 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

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)