arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.08335cs.SIcs.LG
收藏

网络中的压缩贴近度

Compressive Closeness in Networks

Boston University(波士顿大学);ETH(苏黎世联邦理工学院)

Hamidreza Mahyar, Rouzbeh Hasheminezhad, H Eugene Stanley

摘要:

分布式算法的网络科学应用是非常重要的,由于今天的大型现实世界的网络。在这样的算法中,一个节点只允许与它的直接邻居进行本地交互。这是因为整个网络的拓扑结构往往是未知的每个节点。近年来,分布式检测网络中的中心节点,涉及不同的概念的重要性,受到了广泛的关注。接近中心性是一个重要的衡量标准,用于评估节点在给定网络中的重要性(影响力),基于其可访问性。在本文中,首先,我们引入了一个本地(自我为中心)的度量,以及与全球的接近中心,但它具有非常低的计算复杂性。其次,我们提出了一个基于压缩感知(CS)的框架,利用所提出的局部度量准确地恢复网络中的高接近中心节点。以自我为中心的度量计算及其通过CS的聚合都是高效和分布式的,仅使用相邻节点之间的本地交互。最后,我们通过在各种合成和真实网络上的广泛实验来评估所提出的方法的性能。结果表明,该局部度量与全局接近中心度相关性好于现有的局部度量。此外,实验结果表明,该方法优于现有的方法,具有显着的改善。

英文摘要:

Distributed algorithms for network science applications are of great importance due to today's large real-world networks. In such algorithms, a node is allowed only to have local interactions with its immediate neighbors. This is because the whole network topological structure is often unknown to each node. Recently, distributed detection of central nodes, concerning different notions of importance, within a network has received much attention. Closeness centrality is a prominent measure to evaluate the importance (influence) of nodes, based on their accessibility, in a given network. In this paper, first, we introduce a local (ego-centric) metric that correlates well with the global closeness centrality; however, it has very low computational complexity. Second, we propose a compressive sensing (CS)-based framework to accurately recover high closeness centrality nodes in the network utilizing the proposed local metric. Both ego-centric metric computation and its aggregation via CS are efficient and distributed, using only local interactions between neighboring nodes. Finally, we evaluate the performance of the proposed method through extensive experiments on various synthetic and real-world networks. The results show that the proposed local metric correlates with the global closeness centrality, better than the current local metrics. Moreover, the results demonstrate that the proposed CS-based method outperforms the state-of-the-art methods with notable improvement.

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

↑