Spectral theory of weighted hypergraphs via tensors

Abstract

One way to study an 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.

References in corpus (14)

• Multilayer Networks
• On Automorphism Groups of Networks
• Coupled Dynamics on Hypergraphs: Master Stability of Steady States and Synchronization
• Hypergraph model of social tagging networks
• Spectra of general hypergraphs
• An Oriented Hypergraphic Approach to Algebraic Graph Theory
• Spectral Properties of Oriented Hypergraphs
• The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
• Stochastic dynamics on hypergraphs and the spatial majority rule model
• Spectral Theory of Laplace Operators on Oriented Hypergraphs
• The Quantum Entropy Cone of Hypergraphs
• Adjacency and Tensor Representation in General Hypergraphs Part 1: e-adjacency Tensor Uniformisation Using Homogeneous Polynomials
• Adjacency and Tensor Representation in General Hypergraphs.Part 2: Multisets, Hb-graphs and Related e-adjacency Tensors
• On the spectrum of directed uniform and non-uniform hypergraphs