Eigenvariety of Nonnegative Symmetric Weakly Irreducible Tensors Associated with Spectral Radius and Its Application to Hypergraphs

TL;DR

This paper studies the eigenvariety of nonnegative symmetric weakly irreducible tensors, revealing its module structure, and applies these findings to hypergraphs to derive bounds related to their structural properties.

Contribution

It introduces the module structure of the eigenvariety for such tensors, defines stabilizing parameters, and applies these concepts to hypergraphs to establish new bounds.

Findings

The eigenvariety admits a module structure determined by the tensor's support.

Upper bounds for stabilizing index and dimension are established.

Applications to hypergraphs provide bounds based on structural parameters.

Abstract

For a nonnegative symmetric weakly irreducible tensor, its spectral radius is an eigenvalue corresponding to a unique positive eigenvector up to a scalar called the Perron vector. But including the Perron vector, there may have more than one eigenvector corresponding to the spectral radius. The projective eigenvariety associated with the spectral radius is the set of the eigenvectors corresponding to the spectral radius considered in the complex projective space. In this paper we proved that such projective eigenvariety admits a module structure, which is determined by the support of the tensor and can be characterized explicitly by solving the Smith normal form of the incidence matrix of the tensor. We introduced two parameters: the stabilizing index and the stabilizing dimension of the tensor, where the former is exactly the cardinality of the projective eigenvariety and the latter is the composition length of the projective eigenvariety as a module. We give some upper bounds for the two parameters, and characterize the case that there is only one eigenvector of the tensor corresponding to the spectral radius, i.e. the Perron vector. By applying the above results to the adjacency tensor of a connected uniform hypergraph, we give some upper bounds for the two parameters in terms of the structural parameters of the hypergraph such as path cover number, matching number and the maximum length of paths.