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 eigenvalues with some techniques from numerical algebraic geometry.
Spectral theory of weighted hypergraphs via tensors
Venturello L.
2022-01-01
Abstract
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 eigenvalues with some techniques from numerical algebraic geometry.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
