隐链接检测与G-介数
Detection Implicit Links and G-betweenness
摘要：
本文定义了复杂网络的隐式连接概念，并引入了一个新的数值-内聚因子，它可以用数值的方法来评价任意两个节点之间是否存在这种连接。我们引入了一个泛化的介数，这使得网络节点的排名更详细的特点。数值算例表明了所提概念的有效性。
英文摘要：
A concept of implicit links for Complex Networks has been defined and a new value - cohesion factor, which allows to evaluate numerically the presence of such connection between any two nodes, has been introduced. We introduce a generalization of such characteristics as the betweenness, which allows to rank network nodes in more details. The effectiveness of the proposed concepts is shown by the numerical examples.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
