arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1410.6572cs.DMcond-mat.dis-nncs.SImath.COphysics.soc-ph
收藏

基于谱方法和测地路径的网络核心结构检测

Detection of Core-Periphery Structure in Networks Using Spectral Methods and Geodesic Paths

Mihai Cucuringu, Puck Rombach, Sang Hoon Lee, Mason A. Porter

摘要:

我们介绍了几种新的和计算效率高的方法来检测网络中的“核心-外围结构”。核心-外围结构是一种由密集连接的核心顶点和稀疏连接的外围顶点组成的中尺度结构。核心顶点倾向于在它们自己之间以及到外围顶点都是良好连接的,而外围顶点倾向于不与其他顶点良好连接。我们的第一种方法,这是基于网络中的运输,聚集信息从许多测地线路径在网络中,并产生一个分数为每个顶点,反映了一个顶点是一个核心顶点的可能性。我们的第二种方法是基于网络邻接矩阵的低秩近似,它通常可以表示为张量积矩阵。我们的第三种方法使用随机行走拉普拉斯算子的底部特征向量来推断核心分数和核心和外围顶点的分类。我们还设计了一个目标函数,以(1)帮助将顶点分类为核心或外围顶点,以及(2)为核心与外围顶点的分类提供拟合优度标准。为了检验我们的方法的性能,我们将我们的算法应用于合成生成的网络和从真实世界的数据集构建的各种网络。

英文摘要:

We introduce several novel and computationally efficient methods for detecting "core--periphery structure" in networks. Core--periphery structure is a type of mesoscale structure that includes densely-connected core vertices and sparsely-connected peripheral vertices. Core vertices tend to be well-connected both among themselves and to peripheral vertices, which tend not to be well-connected to other vertices. Our first method, which is based on transportation in networks, aggregates information from many geodesic paths in a network and yields a score for each vertex that reflects the likelihood that a vertex is a core vertex. Our second method is based on a low-rank approximation of a network's adjacency matrix, which can often be expressed as a tensor-product matrix. Our third approach uses the bottom eigenvector of the random-walk Laplacian to infer a coreness score and a classification into core and peripheral vertices. We also design an objective function to (1) help classify vertices into core or peripheral vertices and (2) provide a goodness-of-fit criterion for classifications into core versus peripheral vertices. To examine the performance of our methods, we apply our algorithms to both synthetically-generated networks and a variety of networks constructed from real-world data sets.

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

↑