arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.2678cs.SIphysics.data-anphysics.soc-ph
收藏

高模块化的坏社区

Bad Communities with High Modularity

Athanasios Kehagias, Leonidas Pitsoulis

摘要:

在本文中,我们讨论了纽曼的模块化功能QN的一些问题。给定一个图G,G的模块度可以写为QN = Qf -Q 0,其中Qf是G的簇内边缘分数,Q 0是空模型的预期簇内边缘分数,即,一个与G具有相同期望度分布的随机连通图。因此,QN的最大化必须适应两个相反方向的因素:Qf有利于少量的集群,Q 0有利于许多平衡的(即,具有近似相等的度数)集群。在某些情况下,Q 0项可能导致高估真实的簇数;这与众所周知的由模块化的“分辨率限制”引起的估计不足效应相反。我们通过构建具有“自然”社区结构的图族来说明高估效应,然而,该社区结构并不最大化模块性。事实上,我们证明,我们总是可以找到一个图G的“自然聚类”V和另一个,G的平衡聚类U,使得(i)对(G; U)具有更高的模块性比(G; V)和(ii)V和U是任意不同的。

英文摘要:

In this paper we discuss some problematic aspects of Newman's modularity function QN. Given a graph G, the modularity of G can be written as QN = Qf -Q0, where Qf is the intracluster edge fraction of G and Q0 is the expected intracluster edge fraction of the null model, i.e., a randomly connected graph with same expected degree distribution as G. It follows that the maximization of QN must accomodate two factors pulling in opposite directions: Qf favors a small number of clusters and Q0 favors many balanced (i.e., with approximately equal degrees) clusters. In certain cases the Q0 term can cause overestimation of the true cluster number; this is the opposite of the well-known under estimation effect caused by the "resolution limit" of modularity. We illustrate the overestimation effect by constructing families of graphs with a "natural" community structure which, however, does not maximize modularity. In fact, we prove that we can always find a graph G with a "natural clustering" V of G and another, balanced clustering U of G such that (i) the pair (G; U) has higher modularity than (G; V) and (ii) V and U are arbitrarily different.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑