【摘 要】
：
Let △ be a probability simplex, let △t be the Cartesian product of t copies of △, and let f be a t-linear map from △t to △. We consider the iterations
【机 构】
：
ShanghaiJiaoTongUniversity
【出 处】
：
2016年张量和矩阵学术研讨会(International conference on Tensor, Matrix a
论文部分内容阅读
Let △ be a probability simplex, let △t be the Cartesian product of t copies of △, and let f be a t-linear map from △t to △. We consider the iterations of the map which sends (x1, . . . , xt)∈△t to (x2, . . . , xt, f (x1, . . . , xt))∈△t. We report some observations on the combinatorial properties of this dynamical system as well as its Boolean counterpart. This is joint work with Zongchen Chen, Zeying Xu and Yinfeng Zhu.
其他文献
In this talk, we first review some results related Sylvester-type matrix equations and matrix decompositions. Then we investigate and analyze in detail the
A Hankel tensor is called a strong Hankel tensor if the Hankel matrix generated by its generating vector is positive semi-definite. It is known that an even
An iterative method for calculating the largest eigenvalue of a nonnegative tensor was proposed by Ng, Qi and Zhou in 2009. In this paper, two extrapolated
In this presentation, we would like to investigate some adaptive gradient methods for generalized tensor eigenvalue complementarity problem (TEiCP). Firstly
Computing a few eigenpairs from large-scale symmetric eigenvalue problems is far beyond the tractability of classic eigensolvers when the storage of the eig
This talk is concerned with solving some structured multi-linear systems, especially focusing on the equations whose coeffcient tensors are M-tensors, or ca
In this talk I will talk about the latest development of applications of tensor theory to probability and statistics. Those include the moment tensor of ran
Transition probability tensors of order 3 in dimension 3 and of order 4 in dimension 2 are studied. In both cases, we prove that an irreducible symmetric tr
Low rank tensor learning, such as low rank tensor approximation, tensor completion, as well as multilinear multitask learning, draws much attention in recen
In this talk, some recent results on adjacency, singless Laplacian and Laplacian H-eigenvalues of hypergraphs are reported. In particular, we investigate k-