Largest and Least H-Eigenvalues of Symmetric Tensors and Hypergraphs

by   Hongying Lin, et al.

In tensor eigenvalue problems, one is likely to be more interested in H-eigenvalues of tensors. The largest H-eigenvalue of a nonnegative tensor or of a uniform hypergraph is the spectral radius of the tensor or of the uniform hypergraph. We find upper bounds and lower bounds (interlacing inequalities) for the largest H-eigenvalue of a principal subtensor of a symmetric zero diagonal tensor that is of even order or nonnegative, as well as lower bounds for the largest H-eigenvalue of a uniform hypergraph with some vertices or edges removed. We also investigate similar problems for the least H-eigenvalues. We give examples to verify the sharpness of the bounds or in some cases for uniform hypergraphs, we characterize the equality. Particularly, for a connected linear k-uniform hypergraph G with v∈ V(G), we give a sharp lower bound for the spectral radius of G-v in terms of the spectral radius of G and the degree of v and characterize the extremal hypergraphs, and show that the maximum spectral radius of the subhypergraphs with one vertex removed is greater than or equal to the spectral radius of the hypergraph minus one, which is attained if and only if it is a Steiner system S(2,k,n).


page 1

page 2

page 3

page 4


On the α-spectral radius of hypergraphs

For real α∈ [0,1) and a hypergraph G, the α-spectral radius of G is the ...

Finding the spectral radius of a nonnegative irreducible symmetric tensor via DC programming

The Perron-Frobenius theorem says that the spectral radius of an irreduc...

On the spectrum and linear programming bound for hypergraphs

The spectrum of a graph is closely related to many graph parameters. In ...

Edge Expansion and Spectral Gap of Nonnegative Matrices

The classic graphical Cheeger inequalities state that if M is an n× n sy...

Uniform Error Estimates for the Lanczos Method

The Lanczos method is one of the most powerful and fundamental technique...

Tighter Bound Estimation for Efficient Biquadratic Optimization Over Unit Spheres

Bi-quadratic programming over unit spheres is a fundamental problem in q...

Please sign up or login with your details

Forgot password? Click here to reset