Spectra of uniform hypergraphs
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 475375 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- scientific article; zbMATH DE number 3068971 (Why is no real title available?)
- A generalization of the Motzkin-Straus theorem to hypergraphs
- A new 5‐arc‐transitive cubic graph
- Algebraic connectivity of an even uniform hypergraph
- Analogue of the identity Log Det = Trace Log for resultants
- Eigenvalues of a real supersymmetric tensor
- Hypergraphs, quasi-randomness, and conditions for regularity
- Laplacian eigenvalues and partition problems in hypergraphs
- On Unicursal Paths in a Network of Degree 4
- On the second eigenvalue of hypergraphs
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Perron-Frobenius theorem for nonnegative tensors
- Recent results in the theory of graph spectra
- Spectra of hypergraphs and applications
- The Eigenvalues of a Graph and Its Chromatic Number
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Weak quasi-randomness for uniform hypergraphs
Cited in
(only showing first 100 items - show all)- On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs
- Extremal properties of the distance spectral radius of hypergraphs
- The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
- Expansion in matrix-weighted graphs
- Networks beyond pairwise interactions: structure and dynamics
- A combinatorial method for computing characteristic polynomials of starlike hypergraphs
- 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
- Spectra of weighted uniform hypertrees
- On the spectral radii and principal eigenvectors of uniform hypergraphs
- Some properties on eccentricity matrices of uniform hypertrees
- The second largest spectral radii of uniform hypertrees with given size of matching
- Outer and \((b,c)\) inverses of tensors
- The adjacency and signless Laplacian spectra of cored hypergraphs and power hypergraphs
- Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue
- Largest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges (vertices)
- E-cospectral hypergraphs and some hypergraphs determined by their spectra
- Spectra, Euclidean representations and clusterings of hypergraphs
- A tensor optimization algorithm for computing Lagrangians of hypergraphs
- The \(H\)-spectra of a class of generalized power hypergraphs
- Spectra of cycle and path families of oriented hypergraphs
- The signless Laplacian matrix of hypergraphs
- On some properties of the determinants of tensors
- A trust region algorithm for computing extreme eigenvalues of tensors
- Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs
- Connected hypergraphs with small spectral radius
- Maximizing spectral radii of uniform hypergraphs with few edges
- Eigenvalue bounds of third-order tensors via the minimax eigenvalue of symmetric matrices
- The matching polynomials and spectral radii of uniform supertrees
- Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications
- Symmetry of eigenvalues of Sylvester matrices and tensors
- On the first and second eigenvalue of finite and infinite uniform hypergraphs
- Functional analysis on hypergraphs: density and zeta functions -- applications to molecular graphs and image analysis
- Spectral radius on linear \(r\)-graphs without expanded \(K_{r+1}\)
- Analytic connectivity of \(k\)-uniform hypergraphs
- Spectral radius of r-uniform supertrees with perfect matchings
- The Drazin inverse of an even-order tensor and its application to singular tensor equations
- Spectra of power hypergraphs and signed graphs via parity-closed walks
- Spectral radii of two kinds of uniform hypergraphs
- The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
- The characteristic polynomials of uniform double hyperstars and uniform hypertriangles
- Incidence energy of \(k\)-uniform hypertrees
- A preconditioned tensor splitting iteration method and associated global correction technique for solving multilinear systems
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- Joins of hypergraphs and their spectra
- A family of gradient methods using Householder transformation with application to hypergraph partitioning
- Some bounds on spectral radius of signless Laplacian matrix of k-graphs
- Characterizations of the spectral radius of nonnegative weakly irreducible tensors via a digraph
- Tensor join of hypergraphs and its spectra
- Symmetric nonnegative tensors and copositive tensors
- On adjacency and e-adjacency in general hypergraphs: towards a new e-adjacency tensor
- Computing tensor eigenvalues via homotopy methods
- A bound on the spectral radius of hypergraphs with \(e\) edges
- On spectral hypergraph theory of the adjacency tensor
- Some properties on \(\alpha\)-least eigenvalue of uniform hypergraphs and their applications
- Spectral Turán-type problems on cancellative hypergraphs
- A reduction formula for the characteristic polynomial of hypergraph with pendant edges
- The principal eigenvector to \(\alpha\)-spectral radius of hypergraphs
- The \(\alpha \)-spectral radius of general hypergraphs
- Sharp bounds for the spectral radii of nonnegative tensors
- Hypergraph characterizations of copositive tensors
- On the \(\alpha \)-spectra of uniform hypergraphs and its associated graphs
- Signed \(k\)-uniform hypergraphs and tensors
- Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems
- Extension of Moore–Penrose inverse of tensor via Einstein product
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number
- The largest spectral radius of uniform hypertrees with a given size of matching
- Adjacency spectrum of complete 4-uniform hypergraph.
- 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
- The stabilizing index and cyclic index of the coalescence and Cartesian product of uniform hypergraphs
- \({\mathcal{C}}^k_{m,s}\) as a \(k\)-uniform hypergraph and some its properties
- Spectrum of mixed bi-uniform hypergraphs
- On the irregularity of uniform hypergraphs
- Computing extreme eigenvalues of large scale Hankel tensors
- Comparing the principal eigenvector of a hypergraph and its shadows
- 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
- On the \(\alpha \)-spectral radius of uniform hypergraphs
- The Fiedler vector of a Laplacian tensor for hypergraph partitioning
- The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs
- A modified \(S\)-type eigenvalue localization set of tensors applications
- On the irregularity of uniform hypergraphs
- Primitive tensors and directed hypergraphs
- Minimizing the distance spectral radius of uniform hypertrees with given parameters
- Continuation methods for computing Z-/H-eigenpairs of nonnegative tensors
- Principal eigenvectors and spectral radii of uniform hypergraphs
- Some spectral properties of uniform hypergraphs
- Some properties of the p-spectral radius on tensors for general hypergraphs and their applications
- Spectra of general hypergraphs
- A general result on the spectral radii of nonnegative \(k\)-uniform tensors
- \((\alpha,\beta)\)-labelling method for \(k\)-uniform hypergraph and its applications
- Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs
- Pareto eigenvalue inclusion theorems and copositive tensors
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)
