首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Returnability in complex directed networks (digraphs)
Authors:Ernesto Estrada  Naomichi Hatano
Institution:1. Department of Mathematics, University of Strathclyde, Glasgow G1 1XH, UK;2. Department of Physics, University of Strathclyde, Glasgow G1 1XH, UK;3. Institute of Complex Systems at Strathclyde, University of Strathclyde, Glasgow G1 1XH, UK;4. Institute of Industrial Science, University of Tokyo, Komaba, Meguro 153-8505, Japan
Abstract: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.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号