著者
池田 正弘
出版者
一般社団法人 日本応用数理学会
雑誌
応用数理 (ISSN:24321982)
巻号頁・発行日
vol.31, no.2, pp.2-10, 2021-06-24 (Released:2021-09-30)
参考文献数
29

In the present paper, I review our recent two papers of the joint works with Atsushi Miyauchi (Tokyo Univ.), Yuuki Takai(KIT) and Yuichi Yoshida (NII). I mainly introduce the background of their papers and the fundamental notions for community detection of networks. First I review the notion of Laplacian and Cheegerʼs inequality for the usual undirected graph. After that, I introduce the definition of the (submodular) Laplacian for hypergraphs and the heat on them. Especially, I introduce several properties of the Laplacian and heat such as maximal monotonicity of the Laplacian and well-definedness of the heat and the Personalized PageRank respectively. Moreover, I introduce the application of the properties to the community detection on hypergraphs.