arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.12769cs.SIcs.NAmath.NAphysics.data-an
收藏

超图的核-外围检测

Core-periphery detection in hypergraphs

Francesco Tudisco, Desmond J. Higham

摘要:

核心-外围检测是探索性网络分析中的一项关键任务,其目的是找到核心,即内部连接良好且与外围连接良好的节点集,以及外围,即仅与核心连接(或主要与核心连接)的节点集。在这项工作中,我们提出了一个模型的核心外围为高阶网络建模为超图,我们提出了一种方法来计算一个核心得分向量,量化如何接近每个节点的核心。特别是,我们表明,这种方法解决了相应的非凸核心周边优化问题的全局任意精度。这种方法原来是符合计算的Perron特征向量的非线性超图运营商,适当地定义在超图的关联矩阵,推广最近提出的超图的中心模型。我们进行了几个实验,合成和现实世界的超图显示,所提出的方法优于替代的核心-外围检测算法,特别是那些通过建立图的方法转移到超图设置通过集团扩张。

英文摘要:

Core-periphery detection is a key task in exploratory network analysis where one aims to find a core, a set of nodes well-connected internally and with the periphery, and a periphery, a set of nodes connected only (or mostly) with the core. In this work we propose a model of core-periphery for higher-order networks modeled as hypergraphs and we propose a method for computing a core-score vector that quantifies how close each node is to the core. In particular, we show that this method solves the corresponding non-convex core-periphery optimization problem globally to an arbitrary precision. This method turns out to coincide with the computation of the Perron eigenvector of a nonlinear hypergraph operator, suitably defined in term of the incidence matrix of the hypergraph, generalizing recently proposed centrality models for hypergraphs. We perform several experiments on synthetic and real-world hypergraphs showing that the proposed method outperforms alternative core-periphery detection algorithms, in particular those obtained by transferring established graph methods to the hypergraph setting via clique expansion.

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

↑