arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0801.1964physics.soc-ph
收藏

提高最大化模块度Q的启发式算法的效率

Enhance the Efficiency of Heuristic Algorithm for Maximizing Modularity Q

Yanqing Hu, Jinshan Wu, Zengru Di

摘要:

模块度Q是识别复杂网络社团结构的一个重要函数。本文证明了模块度最大化问题等价于一个非凸二次规划问题。这一结果为提高最大模块度Q的启发式算法的效率提供了一种简单的方法。大量的数值结果表明该方法是有效的。

英文摘要:

Modularity Q is an important function for identifying community structure in complex networks. In this paper, we prove that the modularity maximization problem is equivalent to a nonconvex quadratic programming problem. This result provide us a simple way to improve the efficiency of heuristic algorithms for maximizing modularity Q. Many numerical results demonstrate that it is very effective.

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

↑