Exploring triad-rich substructures by graph-theoretic characterizations in complex networks

• DOI: 10.1016/j.physa.2016.10.021
• Publication Date: 2016-10-16T00:59:04Z
• Authors: Songwei Jia; Lin Gao; Yong Gao; James Nastos; Xiao Wen; Xindong Zhang; Haiyang Wang
• Keywords: Substructure; Triad (sociology)

One of the most important problems in complex networks is how to detect communities accurately. The main challenge lies fact that traditional definition about does not always capture intrinsic features communities. Motivated by observation PPI tend consist an abundance interacting triad motifs, we define a 2-club substructure with diameter 2 possessing triad-rich property describe community. Based on substructure, design DIVision Algorithm using our proposed edge Niche Centrality DIVANC effectively networks. We also extend overlapping proposing simple 2-hop strategy. To verify effectiveness substructures, compare existing algorithms networks, LFR synthetic and football experimental results show outperforms other significantly and, particular, can sparse