A Unifying Modularity in Networks

• 来源期刊: 中国物理快报(英文版)
• 年，卷（期）: 2010,（12）
• 页码范围: 213-216
• 页数: 4页
• 语种: 英文
• DOI: 10.1088/0256-307X/27/12/128901

摘要

We propose a new modularity criterion in complex networks,called the unifying modularity q which is independent of the number of partitions.It is shown that,for a given network,the relationship between the upper limit of Q and the number of the partitions,k,is sup(Qk)=(k-1)/k.Since the range of Q for each partition number is inconsistent,we try to extend the concept Q to unifying modularity q,which is independent of the number of partitions.Subsequently,we indicate that it is more accurately to determine the number of partitions by using unifying modularity q than Q.