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

节点域划分与网络社团数

Nodal domain partition and the number of communities in networks

Bian He, Lei Gu, Xiao-Dong Zhang

摘要:

在复杂网络中,社区数量的检测和评估是一个困难的问题,特别是当社区内部和社区之间的密度边界模糊时。本文利用离散节点域理论,通过网络的拓扑结构和几何特征,给出了一个判断网络中有多少个社团以及如何划分社团的标准。通过捕获某些拉普拉斯特征向量的符号,我们可以将网络分成几个合理的簇。该方法导致了一个快速和有效的算法与应用程序的各种实际网络数据集。

英文摘要:

It is difficult to detect and evaluate the number of communities in complex networks, especially when the situation involves with an ambiguous boundary between the inner- and inter-community densities. In this paper, Discrete Nodal Domain Theory could be used to provide a criterion to determine how many communities a network would have and how to partition these communities by means of the topological structure and geometric characterization. By capturing the signs of certain Laplacian eigenvectors we can separate the network into several reasonable clusters. The method leads to a fast and effective algorithm with application to a variety of real networks data sets.

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

↑