Spectral theory of weighted hypergraphs via tensors

@article{Galuppi2022SpectralTO,
  title={Spectral theory of weighted hypergraphs via tensors},
  author={Francesco Galuppi and Raffaella Mulas and Lorenzo Venturello},
  journal={Linear and Multilinear Algebra},
  year={2022}
}
One way to study a hypergraph is to attach to it a tensor. Tensors are a generalization of matrices, and they are an efficient way to encode information in a compact form. In this paper we study how properties of weighted hypergraphs are reflected on eigenvalues and eigenvectors of their associated tensors. We also show how to efficiently compute eingenvalues with some techniques from numerical algebraic geometry. 
1 Citations

Figures from this paper

The weighted hypergraph with the maximum spectral radius

References

SHOWING 1-10 OF 45 REFERENCES
Spectra of general hypergraphs
On the spectrum of directed uniform and non-uniform hypergraphs
Here, we suggest a method to represent general directed uniform and non-uniform hypergraphs by different connectivity tensors. We show many results on spectral properties of undirected hypergraphs
Normalized Laplace operators for hypergraphs with real coefficients
Chemical hypergraphs and their associated normalized Laplace operators are generalized and studied in the case where each vertex–hyperedge incidence has a real coefficient. We systematically study
Spectral Properties of Oriented Hypergraphs
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. The adjacency and Laplacian eigenvalues of an oriented hypergraph are studied. Eigenvalue
Oriented Hypergraphs: Introduction and Balance
TLDR
Oriented hypergraphs are further decomposed into three families — balanced, balanceable, and unbalanceable — and a complete classification of the balanced circuits of oriented hyper graphs is obtained.
Adjacency and Tensor Representation in General Hypergraphs.Part 2: Multisets, Hb-graphs and Related e-adjacency Tensors
TLDR
HyperBagGraphs (hb-graphs as short) extend hypergraphs by allowing the hyperedges to be multisets by extending the definition of e-adjacency to natural hb- graphs and defining different way of building an e- adjacency tensor that is used withhypergraphs.
Some inequalities on the spectral radius of nonnegative tensors
Abstract The eigenvalues and the spectral radius of nonnegative tensors have been extensively studied in recent years. In this paper, we investigate the analytic properties of nonnegative tensors and
...
...