Motif-based embedding for graph clustering

Community detection in complex networks is a fundamental problem that has been extensively studied owing to its wide range of applications. However, because community detection methods typically rely on the relations between vertices in networks, they may fail to discover higher-order graph substructures, called the network motifs . In this paper, we propose a novel embedding method for graph clustering that considers higher-order relationships involving multiple vertices. We show that our embedding method, which we call motif-based embedding , is more effective in detecting communities than existing graph embedding methods, spectral embedding and force-directed embedding, both theoretically and experimentally. (paper: interdisciplinary statistical mechanics)