Eigenvectors of Z-tensors associated with least H-eigenvalue with application to hypergraphs
Yi-Zheng Fan, Yi Wang, Yan-Hong Bao

TL;DR
This paper investigates the eigenvectors of Z-tensors related to their least H-eigenvalue, providing explicit counts for these eigenvectors in symmetric cases and establishing relationships among Laplacian, adjacency, and signless Laplacian eigenvectors in hypergraphs.
Contribution
It characterizes the eigenvectors associated with the least H-eigenvalue of Z-tensors, especially in symmetric cases, and links these eigenvectors to hypergraph spectral properties.
Findings
Finitely many eigenvectors associated with the least H-eigenvalue.
Explicit count of eigenvectors via Smith normal form for symmetric Z-tensors.
Equivalence of the number of Laplacian, adjacency, and signless Laplacian eigenvectors in hypergraphs.
Abstract
Unlike an irreducible -matrices, a weakly irreducible -tensor can have more than one eigenvector associated with the least H-eigenvalue. We show that there are finitely many eigenvectors of associated with the least H-eigenvalue. If is further combinatorial symmetric, the number of such eigenvectors can be obtained explicitly by the Smith normal form of the incidence matrix of . When applying to a connected uniform hypergraph , we prove that the number of Laplacian eigenvectors of associated with the zero eigenvalue is equal to the the number of adjacency eigenvectors of associated with the spectral radius, which is also equal to the number of signless Laplacian eigenvectors of associated with the zero eigenvalue if zero is an signless Laplacian eigenvalue.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Matrix Theory and Algorithms · Sparse and Compressive Sensing Techniques
Eigenvectors of -tensors associated with least H-eigenvalue with application to hypergraphs
Yi-Zheng Fan∗
School of Mathematical Sciences, Anhui University, Hefei 230601, P. R. China
,
Yi Wang
School of Mathematical Sciences, Anhui University, Hefei 230601, P. R. China
and
Yan-Hong Bao
School of Mathematical Sciences, Anhui University, Hefei 230601, P. R. China
Abstract.
Unlike an irreducible -matrices, a weakly irreducible -tensor can have more than one eigenvector associated with the least H-eigenvalue. We show that there are finitely many eigenvectors of associated with the least H-eigenvalue. If is further combinatorial symmetric, the number of such eigenvectors can be obtained explicitly by the Smith normal form of the incidence matrix of . When applying to a connected uniform hypergraph , we prove that the number of Laplacian eigenvectors of associated with the zero eigenvalue is equal to the the number of adjacency eigenvectors of associated with the spectral radius, which is also equal to the number of signless Laplacian eigenvectors of associated with the zero eigenvalue if zero is an signless Laplacian eigenvalue.
Key words and phrases:
-Tensor, eigenvector, hypergraph, stabilizing index
2000 Mathematics Subject Classification:
Primary 15A18, 05C65; Secondary 13P15, 14M99
∗The corresponding author. This work was supported by National Natural Science Foundation of China (Grant No. 11871073, 11771016, 11871071).
1. Introduction
A real tensor (also called hypermatrix) of order and dimension refers to a multiarray of entries for all and , which can be viewed to be the coordinates of the classical tensor under an orthonormal basis. For a vector , , which is defined as
[TABLE]
Let be the identity tensor of order and dimension , that is, if and otherwise.
Definition 1.1** ([14, 17, 2]).**
Let be an -th order -dimensional tensor. For some , if the polynomial system , or equivalently , has a solution , then is called an eigenvalue of and is an eigenvector of associated with , where .
For a real tensor , an eigenvalue of is called an H-eigenvalue if there is a real eigenvector associated with , implying that is real. Denote by the least H-eigenvalue of , and the spectral radius of (i.e. the largest modulus of the eigenvalues of ). Let be the complex projective spaces of dimension . Consider the projective variety
[TABLE]
which is called the projective eigenvariety of associated with [7]. In this paper the number of eigenvectors of is considered in .
By the Perron-Frobenius theorem of nonnegative tensors [1, 10, 21, 22, 23], for an irreducible (or weakly irreducible) nonnegative tensor , the spectral radius is an eigenvalue of associated with a unique nonnegative eigenvector (or positive eigenvector) up to a scalar, which is called the Perron vector of . In [6] the authors investigate the spectral symmetry of by using the eigenvalues with modulus , which generalizes some spectral properties of nonnegative irreducible matrices. But, different from the matrices case, can have more than one eigenvector associated with , including the Perron vector.
-matrices and -matrices are the generalization of nonnegative matrices. Recently they were generalized to -tensors and -tensors respectively [24, 4].
Definition 1.2** ([24, 4]).**
A real tensor is called a -tensor if all of its off-diagonal entries are non-positive, or equivalently it can be written as
[TABLE]
where and is nonnegative. If , then is called an -tensor; if , then is called a nonsingular -tensor or strong -tensor.
Zhang et al. [24] showed that the minimum real part of all eigenvalues an -tensor is the least H-eigenvalue. Some characterization of a -tensor being an -tensor is given in [24, 4]. Most of these results are generalization of -matrices. Let be a weakly irreducible -tensor as in (1.1). Then . As is nonnegative and weakly irreducible, it can have more than one eigenvector associated with , which implies that can have more than one eigenvector associated with . This is different from the case of irreducible -matrices.
In this paper, we show that for a weakly irreducible -tensor , is a finite abelian group, and admits a -module if is further combinatorial symmetric. For the latter case, the cardinality of can obtained explicitly by solving the Smith normal form of the incidence matrix of . For a connected uniform hypergraph , we show that has the same cardinality as , which is also equal to that of if [math] is an eigenvalue of , where , and are the adjacency, Laplaican and signless Laplacian of respectively.
2. Preliminaries
Let be an -th order -dimensional real tensor. is called symmetric if its entries are invariant under any permutation of their indices. The irreducibility or weakly irreducibility of a tensor can be referred to [1, 10]. The support of , denoted by , is defined as a tensor with same order and dimension as , such that if , and otherwise. is called combinatorial symmetric if is symmetric. Let be a combinatorial symmetric tensor of order and dimension . Set
[TABLE]
Define
[TABLE]
and obtain an matrix , called the incidence matrix of .
A hypergraph consists of a vertex set and an edge set , where for . If for each , then is called an -uniform hypergraph. The adjacency tensor of an -uniform hypergraph is defined to be , where if , and is [math] otherwise [3]. Let be an -th order -dimensional diagonal tensor, where , the degree of the vertex , for each . Then and are called the Laplacian tensor and the signless Laplacian tensor of , respectively [18]. The adjacency, Laplacian or signless Laplacian tensor of is symmetric, and it is weakly irreducible if and only if is connected [16, 23]. The incidence matrix of , denoted by , coincides with that of , namely if , and otherwise.
For a matrix , there exist two invertible matrices and such that
[TABLE]
where , , for , and for all . The matrix in (2.1) is called the Smith normal form of over .
Let be a tensor of order and dimension . Define
[TABLE]
where is an invertible diagonal matrix and the product is defined as in [19].
Definition 2.1** ([7]).**
For a general tensor , the cardinality of , denoted by , is called the stabilizing index of .
By [7, Lemma 2.5(1)], is an abelian group under the usual matrix multiplication, which is determined by the support of by [7, Lemma 2.6]. Suppose that is a nonnegative weakly irreducible tensor. By [23, Theorem 3.7], for each , is the unique positive Perron vector of . Therefore, we can assume each satisfies . Define
[TABLE]
and a quasi-Hadamard product in as follows:
[TABLE]
Lemma 2.2** ([7], Lemma 2.5, Lemma 3.1).**
Let be a nonnegative weakly irreducible tensor. Then the following results hold.
- (1)
, and hence . 2. (2)
* is an abelian group isomorphism to .*
Further assume is also combinatorial symmetric of order . By [7, Lemma 2.5(3)], for each . Hence for each , (the identity), which implies that admits a -module. Define
[TABLE]
where is the incidence matrix of .
Theorem 2.3** ([7]).**
Let be a nonnegative combinatorial symmetric weakly irreducible tensor of order . Then is -module isomorphic to .
Theorem 2.4** ([7]).**
Let be a nonnegative combinatorial symmetric weakly irreducible tensor of order and dimension . Suppose that has a Smith normal form over as in (2.1). Then , and
[TABLE]
Theorem 2.5** ([8]).**
Let be a weakly irreducible nonnegative tensor. Then has dimension zero, i.e. there are finite many eigenvectors of corresponding to up to a scalar.
3. -tensors, Laplacian tensors and signless Laplacian tensors
Lemma 3.1**.**
Let be a -tensor, where and . Then
- (1)
, which is the eigenvalue of with the least real part. 2. (2)
. 3. (3)
, . 4. (4)
For any diagonal tensor , .
Proof.
The first result follows by a similar discussion to [24, Theorem 3.3]. Obviously, is an eigenvector of associated with if and only if it is an eigenvector of associated with . So the second result follow. The last two results follow from the definition. ∎
Lemma 3.2**.**
Let be a weakly irreducible -tensor. Then
- (1)
* is finite, i.e. there are finitely many eigenvectors of associated with .* 2. (2)
* is an abelian group isomorphic to .* 3. (3)
.
Proof.
Suppose , where and . Then by Lemma 3.1. As is nonnegative and weakly irreducible, the finiteness of follows from Theorem 2.5. By Lemma 2.2, , as well as , is an abelian group isomorphic to , which is equal to by Lemma 3.1. ∎
Theorem 3.3**.**
Let be a combinatorial symmetric weakly irreducible -tensor of order and dimension . Suppose that has a Smith normal form over as in (2.1). Then
- (1)
. 2. (2)
* is a -module with the decomposition*
[TABLE] 3. (3)
.
Proof.
Let , where and . Note that is combinatorial symmetric and weakly irreducible, and have the same incidence matrices, i.e. over . So, by Theorem 2.4, . By Theorem 2.3, is -module isomorphic to , which has a decomposition as in (2.6). As by Lemma 3.1, the second result follows. The last result follows from (2) and Lemma 3.2. ∎
Lemma 3.4**.**
The Laplacian tensor of a uniform hypergraph is a singular -tensor.
Proof.
As is diagonal dominant, is an -tensor by [24, Theorem 3.15]. Note that [math] is the least -eigenvalue of associated with an all-ones eigenvector. So is singular. ∎
Theorem 3.5**.**
Let be a connected -uniform hypergraph. Suppose that has a Smith normal form over as in (2.1). Then
[TABLE]
Proof.
As is connected, is a combinatorial symmetric weakly irreducible -tensor. The incidence matrix of is same as that of , i.e. over . So, by Theorem 3.3(3), . The result now follows as by definition. ∎
Let be an -uniform hypergraph on vertices, where is even. is called odd-colorable [15] if there exists a map such that for each , .
Lemma 3.6** ([9]).**
Let be an -uniform connected hypergraph on vertices. Then the following are equivalent.
- (1)
[math]* is an eigenvalue of .* 2. (2)
* is even and is odd-colorable.* 3. (3)
* for some diagonal matrix with .* 4. (4)
.
Theorem 3.7**.**
Let be an -uniform connected hypergraph which is odd-colorable. Suppose that has a Smith normal form over as in (2.1). Then
- (1)
. 2. (2)
.
Proof.
The first result follows by definition and Theorem 2.4. By Lemma 3.6, as is odd-colorable, [math] is an eigenvalue of . Also by Lemma 3.6, there exists an invertible diagonal matrix such that is an eigenvector of associated with [math] if and only if is an eigenvector of associated with [math]. So
[TABLE]
where the last equality follows from Lemma 3.2. By Lemma 2.2, as is nonnegative and weakly irreducible. The result follows. ∎
Example 3.8*.*
Let be a complete -uniform hypergraph on vertices, where . By [7, Example 4.4], , so by Theorem 3.5, which implies that has only one eigenvector (the all-ones vector) associated with the zero eigenvalue.
An odd bipartition of is a bipartition of such that each edge of intersects with or in an odd number of vertices. is called odd-bipartite if has an odd bipartition [11]. Shao et al. [20] proved that [math] is an -eigenvalue of if and only if is even and is odd-bipartite. An odd-bipartite hypergraph is odd-colorable, but the converse is not true [15]. A cored hypergraph [12] is one such that each edge contains a vertex of degree one. Obviously a cored hypergraph of even uniformity is odd-bipartite.
Example 3.9*.*
Let be a connected -uniform cored hypergraph on vertices with edges. Then by [7, Theorem 4.1]. So has eigenvectors associated with the zero eigenvalue. If is even, then is odd-bipartite. So has eigenvectors associated with the zero eigenvalue.
Example 3.10*.*
Let be a generalized power hypergraph [13], which is obtained from a simple graph by blowing each vertex into an -set and preserving the adjacency relation, where is even. It is known that is non-odd-bipartite if and only if is non-bipartite [13]. Suppose that is non-bipartite. Then if and only if divides [5]. Particularly, let be a triangle or and . Then is non-odd-bipartite but odd-colorable by Lemma 3.6. The incidence matrix of has invariant divisors over . So has eigenvectors associated with the zero eigenvalue.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] K. C. Chang, K. Pearson, T. Zhang, Perron-Frobenius theorem for nonnegative tensors, Commu. Math. Sci. , 6 (2008), 507-520.
- 2[2] K. C. Chang, K. Pearson, T. Zhang, On eigenvalue problems of real symmetric tensors, J. Math. Anal. Appl. , 350 (2009), 416-422.
- 3[3] J. Cooper, A. Dutle, Spectra of uniform hypergraphs, Linear Algebra Appl. , 436 (9)(2012), 3268-3292.
- 4[4] W. Ding, L. Qi, Y. Wei, M 𝑀 M -tensors and nonsingular M 𝑀 M -tensors, Linear Algebra Appl. , 439 (2013), 3264-3278.
- 5[5] Y.-Z. Fan, M. Khan, Y.-Y. Tan, The largest H-eigenvalue and spectral radius of Laplaican tensor of non-odd-bipartite generalized power hypergraphs, Linear Algebra Appl. , 504 (2016), 487-502.
- 6[6] Y.-Z. Fan, T. Huang, Y.-H. Bao, C.-L. Zhuan-Sun, Y.-P. Li, The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs, Trans. Amer. Math. Soc. , DOI: https://doi.org/10.1090/tran/7741.
- 7[7] Y.-Z. Fan, Y.-H. Bao, T. Huang, Eigenvariety of nonnegative symmetric weakly irreducible tensors associated with spectral radius and its application to hypergraphs, Linear Algebra Appl. , 564 (2019), 72-94.
- 8[8] Y.-Z. Fan, T. Huang, Y.-H. Bao, The dimension of eigenvariety of nonnegative tensors associated with spectral radius, Available at ar Xiv: 1710.04079 v 3.
