Returnability in complex directed networks (digraphs)
Returnability in complex directed networks (digraphs)
复制标题
DOI：
10.1016/j.laa.2008.09.033
复制
发表时间：
2009-04-15
影响因子：
1.1
通讯作者：
Hatano, Naomichi
中科院分区：
文献类型：
--
作者：
Estrada, Ernesto;Hatano, Naomichi
提出了复杂有向网络（有向图）的可返回性概念。它可以被看作是对互惠概念的概括。介绍了两种可退货性的度量方法。建立了与有向图谱有关的可退货性测度的封闭计算公式。对有向图的简单例子和现实世界的复杂有向网络计算了这两个度量，并与互易性进行了比较。(C) 2008爱思唯尔公司版权所有。
The concept of returnability is proposed for complex directed networks (digraphs). it can be seen as a generalization of the concept of reciprocity. Two measures of the returnability are introduced. We establish closed formulas for the calculation of the returnability measures, which are also related to the digraph spectrum. The two measures are calculated for simple examples of digraphs as well as for real-world complex directed networks and are compared with the reciprocity. (C) 2008 Elsevier Inc. All rights reserved.