相关论文: A new S-type eigenvalue localization set for tenso…

An algorithm for finding the eigenvalue of a nonnegative irreducible tensor was recently proposed by Michael Ng, Liqun Qi, and Guanglu Zhou in {\it Finding the largest eigenvalue of a nonnegative tensor}. However, the authors did not prove…

In this paper we propose new techniques to sample arbitrary third-order tensors, with an objective of speeding up tensor algorithms that have recently gained popularity in machine learning. Our main contribution is a new way to select, in a…

For a complex tensor A, Minimal Gersgorin tensor eigenvalue inclusion set of A is presented, and its sufficient and necessary condition is given. Furthermore, we study its boundary by the spectrums of the equimodular set and the extended…

The results of Strassen and Raz show that good enough tensor rank lower bounds have implications for algebraic circuit/formula lower bounds. We explore tensor rank lower and upper bounds, focusing on explicit tensors. For odd d, we…

We give a spectral algorithm for decomposing overcomplete order-4 tensors, so long as their components satisfy an algebraic non-degeneracy condition that holds for nearly all (all but an algebraic set of measure $0$) tensors over…

We prove a non-asymptotic concentration inequality for the spectral norm of sparse inhomogeneous random tensors with Bernoulli entries. For an order-$k$ inhomogeneous random tensor $T$ with sparsity $p_{\max}\geq \frac{c\log n}{n }$, we…

We are concerned with the eigenstructure of supersymmetric tensors. Like in the matrix case, normalized tensor eigenvectors are fixed points of the tensor power iteration map. However, unless the given tensor is orthogonally decomposable,…

Consider a complex Hilbert space $\left(\mathcal{H}, \langle \cdot, \cdot \rangle\right)$ equipped with a positive bounded linear operator $A$ on $\mathcal{H}$. This induces a semi-norm $\|\cdot\|_A$ through the semi-inner product $\langle…

In this paper, we study the spectral radius of the clique tensor A(G) associated with a graph G. This tensor is a higher-order extensions of the adjacency matrix of G. A lower bound of the clique number is given via the spectral radius of…

In this paper, we introduce the concept of an $m$-order $n$-dimensional generalized Hilbert tensor $\mathcal{H}_{n}=(\mathcal{H}_{i_{1}i_{2}\cdots i_{m}})$, $$ \mathcal{H}_{i_{1}i_{2}\cdots i_{m}}=\frac{1}{i_{1}+i_{2}+\cdots i_{m}-m+a},\…

The problem of compressive detection of random subspace signals is studied. We consider signals modeled as $\mathbf{s} = \mathbf{H} \mathbf{x}$ where $\mathbf{H}$ is an $N \times K$ matrix with $K \le N$ and $\mathbf{x} \sim…

We prove a lower bound on the rank of tensors constructed from families of linear maps that `expand' the dimension of every subspace. Such families, called {\em dimension expanders} have been studied for many years with several known…

A variety of scientific fields like proteomics and spintronics have created a new demand for on-chip devices capable of sensing parameters localized within a few tens of micrometers. Nano and microelectromechanical systems (NEMS/MEMS) are…

Quantum field theories can be applied to compute various statistical properties of random tensors. In particular signed distributions of tensor eigenvalues/vectors are the easiest, which can be computed as partition functions of four-fermi…

Improving upon results of Rudelson and Vershynin, we establish delocalization bounds for eigenvectors of independent-entry random matrices. In particular, we show that with high probability every eigenvector is delocalized, meaning any…

The first author with B. Sturmfels studied the variety of matrices with eigenvectors in a given linear subspace, called Kalman variety. We extend that study from matrices to symmetric tensors, proving in the tensor setting the…

In this article, we present various new results on Cauchy tensors and Hankel tensors. { We first introduce the concept of generalized Cauchy tensors which extends Cauchy tensors in the current literature, and provide several conditions…

We determine the border subrank of higher order structure tensors of several families of algebras, and in particular obtain the following results. (1) We determine tight bounds on the border subrank of $k$-fold matrix multiplication and…

In this paper we propose an iterative algorithm to find out the spectral radius of nonnegative tensors. This algorithm is an extension of the smoothing method for finding the largest eigenvalue of a nonnegative matrix \cite{s14}. For…

We study orthogonal decompositions of symmetric and ordinary tensors using methods from linear algebra. For the field of real numbers we show that the sets of decomposable tensors can be defined be equations of degree 2. This gives a new…