复杂网络中的“猜想”链接
"Conjectural" links in complex networks
摘要:
本文介绍了复杂网络,特别是社交网络中的猜想链接的概念。我们将推测链路理解为一种隐式链路,在网络中不可用,但根据其拓扑结构的特征应该存在。例如,当在网络的形式描述中,由于错误而跳过某些连接时,故意隐藏或撤回(例如,在网络部分破坏的情况下)。引入了一个参数,允许排名的猜测链接。此参数越多-此连接在网络中存在的可能性越大。本文提出了一种利用猜测链接发现的复杂网络部分破坏恢复方法。提出了两种寻找彼此不直接相连,但彼此之间有很大可能进行猜想链路通信的节点对的方法:一种是基于确定两个节点之间的电阻的方法,另一种是基于计算两个节点之间的路由长度的方法。回顾了几个真实网络的例子,并进行了比较,以了解网络链接预测方法,而不是为了在已经形成的网络中找到缺失的链接。
英文摘要:
This paper introduces the concept of Conjectural Link for Complex Networks, in particular, social networks. Conjectural Link we understand as an implicit link, not available in the network, but supposed to be present, based on the characteristics of its topology. It is possible, for example, when in the formal description of the network some connections are skipped due to errors, deliberately hidden or withdrawn (e.g. in the case of partial destruction of the network). Introduced a parameter that allows ranking the Conjectural Link. The more this parameter - the more likely that this connection should be present in the network. This paper presents a method of recovery of partially destroyed Complex Networks using Conjectural Links finding. Presented two methods of finding the node pairs that are not linked directly to one another, but have a great possibility of Conjectural Link communication among themselves: a method based on the determination of the resistance between two nodes, and method based on the computation of the lengths of routes between two nodes. Several examples of real networks are reviewed and performed a comparison to know network links prediction methods, not intended to find the missing links in already formed networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。