论文部分内容阅读
The Laplacian eigenvalue of a graph plays an important role in controlling other graph parameters.It is closed related to random walks.In this talk,we introduce a set of Laplacian eigenvalues of a uniform hypergraph by considering high-order random walks and we also calculate the Laplacian eigenvalues of random hypergraphs.