Formalising and Detecting Community Structures in Real World Complex Networks

• 作者: KUMAR Pawan DOHARE Ravins
• 来源期刊: 系统科学与复杂性学报（英文版）
• 年，卷（期）: 2021,（1）
• 页码范围: 180-205
• 页数: 26页
• 语种: 英文
• DOI: 10.1007/s11424-020-9252-3

摘要

Community structure is an integral characteristic of real world networks whichever pro-cesses or areas they emerge from.This paper addresses the problem of community structure detection theoretically as well as computationally.The authors introduce a number of concepts such as the neigh-bourhood and strength of a subgraph,p-community,local maximal p-community,hubs,and outliers that play elemental role in formalising the concept of community structure in complex networks.A few preliminary results have been derived that lead to the development of an algorithm for community structure detection in undirected unweighted networks.The algorithm is based on a local seed expan-sion strategy that uses the concept of interaction coefficient.The authors have analysed the algorithm on a number of parameters such as accuracy,stability,and quality on synthetic and real world networks from different areas.