A Weighted Parsimony Model for Community Detection in Complez Networks

摘要：

Many real-world networks have a common feature of organization, i.e, community structure. Detecting this structure is fundamental for uncovering the links between the structure and the function in complex networks and for practical applications in many disciplines such as biology and sociology. In this paper we propose a weighted parsimony criterion for community detection in complex networks. This criterion relates communities with cliques (or complete subgraphs). Parsimony here means that as minimal as possible number of inserted and deleted edges is needed when we make the network considered become a disjoint union of cliques. A weight based on the topological features of the network is introduced to ensure the obtained subgraphs to be communities by balancing the inserted and deleted edges. Tests on real networks give excellent results.

关键词： Community detection parsimony cliques complez networks

作者: Junhua Zhang Xiang-Sun Zhang

作者单位: Academy of Mathematics and Systems Science,CAS,Beijing 100190,China Key Laboratory of Random Complex Academy of Mathematics and Systems Science,CAS,Beijing 100190,China

会议类型: 国际会议

会议名称: The 3rd International Symposium on Optimization and System Biology(第三届最优化与系统生物学国际会议 OSB09)

会议地点: 张家界

会议语种:英文

页码: 419-429

在线出版日期: 2009-09-20（万方平台首次上网日期，不代表论文的发表时间）