Quasi-Irreducibility of Nonnegative Biquadratic Tensors
Liqun Qi, Chunfeng Cui, Yi Xu
TL;DR
The paper addresses spectral analysis of nonnegative biquadratic tensors, focusing on adjacency tensors of bipartite 2-graphs which are reducible, and introduces quasi-irreducibility to capture spectral properties. It defines $x$- and $y$-quasi-reducibility and proves that a non-bi-separable bipartite 2-graph yields a quasi-irreducible adjacency tensor, while the largest $M$-eigenvalue for quasi-irreducible tensors is constrained to be either an $M^0$- or an $M^{++}$-eigenvalue; furthermore, it establishes a max-min theorem for the $M$-spectral radius. The work also discusses the NP-hardness of computing the largest $M$-eigenvalue for general biquadratic tensors and delineates tractable cases within the nonnegative regime, including a proposed pathway via Problems 1–3 and related Collatz-type algorithms. Collectively, these results extend Perron-Frobenius-type spectral theory to quasi-irreducible nonnegative biquadratic tensors and inform spectral hypergraph analysis and algorithmic approaches for eigenvalue computation.
Abstract
While the adjacency tensor of a bipartite 2-graph is a nonnegative biquadratic tensor, it is inherently reducible. To address this limitation, we introduce the concept of quasi-irreducibility in this paper. The adjacency tensor of a bipartite 2-graph is quasi-irreducible if that bipartite 2-graph is not bi-separable. This new concept reveals important spectral properties: although all M$^+$-eigenvalues are M$^{++}$-eigenvalues for irreducible nonnegative biquadratic tensors, the M$^+$-eigenvalues of a quasi-irreducible nonnegative biquadratic tensor can be either M$^0$-eigenvalues or M$^{++}$-eigenvalues. Furthermore, we establish a max-min theorem for the M-spectral radius of a nonnegative biquadratic tensor.
