| ABSTRACT |
Pairwise interactions between two vertices are encoded in edges of graph networks. However, these edges are not sufficient to describe a wide variety of interactions arising from the world around us. Recently, faces in simplicial complexes have been employed to represent interactions among more than two vertices, which have shown various applications in several areas. In this talk, I will introduce where higher-order interactions emerge and explain a simplicial generalization of graph Laplacians as a tool for analyzing simplicial networks. |
