Adjacency, signless Laplacian and Laplacian H-eigenvalues of hypergraphs

来源 :2016年张量和矩阵学术研讨会(International conference on Tensor, Matrix a | 被引量 : 0次 | 上传用户：neo1997

【摘要】

：

　　In this talk, some recent results on adjacency, singless Laplacian and Laplacian H-eigenvalues of hypergraphs are reported. In particular, we investigate k-

【作者】

：

Liping Zhang

【机构】

：

TsinghuaUniversity

【出处】

：

2016年张量和矩阵学术研讨会(International conference on Tensor, Matrix a

【发表日期】

：

2016年5期

下载到本地 , 更方便阅读

下载此文赞助VIP

声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架

论文部分内容阅读

　　In this talk, some recent results on adjacency, singless Laplacian and Laplacian H-eigenvalues of hypergraphs are reported. In particular, we investigate k-uniform loose paths. We show that the largest H-eigenvalues of their adjacency tensors, Laplacian tensors, and signless Laplacian tensors are computable and their bounds are given.

其他文献

Sharp Brauer-type Eigenvalue Inclusion Theorems for Tensors

　　In this paper, some new Brauer-type eigenvalue inclusion theorems are established for general tensors. We show that new eigenvalue inclusion sets are sharpe

会议

Sylvester-type matrix equations and simultaneous decompositions for some sets of matrices

　　In this talk, we first review some results related Sylvester-type matrix equations and matrix decompositions. Then we investigate and analyze in detail the

会议

Some new classes of positive semi-definite Hankel tensors

　　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

会议

Extrapolated Acceleration Methods for the Computation of the Largest Eigenvalue of Nonnegative Tenso

　　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

会议

Adaptive gradient methods for generalized tensor eigenvalue complementarity problem (TEiCP)

　　In this presentation, we would like to investigate some adaptive gradient methods for generalized tensor eigenvalue complementarity problem (TEiCP). Firstly

会议

Large Scale Eigenvalue Computation Using Tensor-Train Format

　　Computing a few eigenpairs from large-scale symmetric eigenvalue problems is far beyond the tractability of classic eigensolvers when the storage of the eig

会议

Solving Multi-linear Systems with M-Tensors

　　This talk is concerned with solving some structured multi-linear systems, especially focusing on the equations whose coeffcient tensors are M-tensors, or ca

会议

Some Recent Applications of Tensors in Probability and Statistics

　　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

会议

On the uniqueness of the Z1-eigenvector of transition probability tensors

　　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

会议

Rank-One Tensor Updating Algorithms for A Class of Low Rank Tensor Learning (Optimization) Problems

　　Low rank tensor learning, such as low rank tensor approximation, tensor completion, as well as multilinear multitask learning, draws much attention in recen

会议

Adjacency, signless Laplacian and Laplacian H-eigenvalues of hypergraphs

其他学术论文