On the principal eigenvectors of uniform hypergraphs (1605.09281v3)

Abstract: Let $\mathcal{A}(H)$ be the adjacency tensor of $r$-uniform hypergraph $H$. If $H$ is connected, the unique positive eigenvector $x=(x_1,x_2,\ldots,x_n)^{\mathrm{T}}$ with $||x||r=1$ corresponding to spectral radius $\rho(H)$ is called the principal eigenvector of $H$. The maximum and minimum entries of $x$ are denoted by $x{\max}$ and $x_{\min}$, respectively. In this paper, we investigate the bounds of $x_{\max}$ and $x_{\min}$ in the principal eigenvector of $H$. Meanwhile, we also obtain some bounds of the ratio $x_i/x_j$ for $i$, $j\in [n]$ as well as the principal ratio $\gamma(H)=x_{\max}/x_{\min}$ of $H$. As an application of these results we finally give an estimate of the gap of spectral radii between $H$ and its proper sub-hypergraph $H'$.