原创力文档- 1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
- 2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
- 4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
- 5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传，每下载1次， 网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
中国科技论文在线
Resolution limit in community detection for an
information-theoretic method#
*
SUN Penggang
5 (School of Computer Science and Techonology, Xidian University)
Abstract: Resolution limit in community detection is a very important problem, which gives a new
challenge to the methods for community detection. The modularity optimization exposes to this
problem in that two or more cliques may merge into a single group or a clique may split into more than
two parts. In this paper, we give a comprehensive analysis on the resolution limit problem for an
10 information-theoretic method that considers the process of community detection for a network as a
communication process by finding an optimal compression of its topology structure. We first discuss
the entropy, H(Z) or the description length, L(X|Y) for the fitted model (L(X|Y)= H(Z)) when the
number of communities is known in advance for a network. Then, when the number of communities is
unknown in advance, we mechanistically study the full description length, L(Y)+ L(X|Y) (L(Y), the
15 description length of the model itself). We hope the results in this paper may provide us a deep
understanding for the information-theoretic method.
Key words: community detection; resolution limits; information theory
0 Introduction
Most complex networks/systems are made of communities that are su
文档评论（0）