Related papers: Probabilistic estimates for tensor products of ran…
Many applications in data science and scientific computing involve large-scale datasets that are expensive to store and compute with, but can be efficiently compressed and stored in an appropriate tensor format. In recent years, randomized…
The approximation numbers of the $L_2$-embedding of mixed order Sobolev functions on the $d$-torus are well studied. They are given as the nonincreasing rearrangement of the $d$-th tensor power of the approximation number sequence in the…
We show the density of eigenvalues for three classes of random matrix ensembles is determinantal. First we derive the density of eigenvalues of product of $k$ independent $n\times n$ matrices with i.i.d. complex Gaussian entries with a few…
We argue first that translational invariant Matrix Product can be interpreted as a stationary sea of particles. Next, rather than starting from some local Hamiltonian with random potentials, we consider fluctuations of the local tensors of…
Given a positive integer $n$ and a partition $(n_1,\ldots,n_r)$ of $n$, one can consider the associated $n$-dimensional multiprojective space $\mathbb{P}^{n_1}\times \cdots \times \mathbb{P}^{n_r}$. These multiprojective spaces are…
Quantitative bounds for random embeddings of $\mathbb{R}^{k}$ into Lorentz sequence spaces are given, with improved dependence on $\varepsilon$.
This work deals with developing two fast randomized algorithms for computing the generalized tensor singular value decomposition (GTSVD) based on the tubal product (t-product). The random projection method is utilized to compute the…
Probabilistic inference is a fundamental task in modern machine learning. Recent advances in tensor network (TN) contraction algorithms have enabled the development of better exact inference methods. However, many common inference tasks in…
In this paper, we introduce a type of tensor neural network. For the first time, we propose its numerical integration scheme and prove the computational complexity to be the polynomial scale of the dimension. Based on the tensor product…
In this paper, some tensor commutation matrices are expressed in termes of the generalized Pauli matrices by tensor products of the Pauli matrices.
The concept of a crossed tensor product of algebras is studied from a few points of views. Some related constructions are considered. Crossed enveloping algebras and their representations are discussed. Applications to the noncommutative…
We introduce a method for extracting meaningful entanglement measures of tensor network states in general dimensions. Current methods require the explicit reconstruction of the density matrix, which is highly demanding, or the contraction…
We study integration and $L^2$-approximation of functions of infinitely many variables in the following setting: The underlying function space is the countably infinite tensor product of univariate Hermite spaces and the probability measure…
We introduce the tensor product of polygonal cell complexes, which interacts nicely with the tensor product of link graphs of complexes. We also develop the unique factorization property of polygonal cell complexes with respect to the…
We write, for geometric index values, a probabilistic proof of the product formula for spherical Bessel functions. Our proof has the merit to carry over without any further effort to Bessel-type hypergeometric functions of one matrix…
This is a note for constructing fundamental invariants and computing the Hilbert series of the invariant subalgebras of tensor products of polynomial rings under the action by a direct product of symmetric groups. Our computation relies on…
In statistics, assuming samples are independent is reasonable. However, this property can fail to hold for the features, a distinction that has led to several lines of work aiming to remove the latter assumption of independence present in…
Complicated mathematical equations involving products of tensors with permutation symmetries, frequently encountered in fields such as general relativity and quantum chemistry (e.g., equations in high-order coupled cluster theories),…
We obtain sharp bounds on the convergence rate of Markov chains on irreducible representations of finite general linear, unitary, and symplectic groups (in both odd and even characteristic) given by tensoring with Weil representations.
This is Part II of our work about random tensor inequalities and tail bounds for bivariate random tensor means. After reviewing basic facts about random tensors, we first consider tail bounds with more general connection functions. Then, a…