Picture of a sphere with binary code

Making Strathclyde research discoverable to the world...

The Strathprints institutional repository is a digital archive of University of Strathclyde research outputs. It exposes Strathclyde's world leading Open Access research to many of the world's leading resource discovery tools, and from there onto the screens of researchers around the world.

Explore Strathclyde Open Access research content

Returnability in complex directed networks (digraphs)

Estrada, E. and Hatano, N. (2009) Returnability in complex directed networks (digraphs). Linear Algebra and Its Applications, 490. pp. 1886-1896. ISSN 0024-3795

[img]
Preview
PDF (strathprints014343.pdf)
strathprints014343.pdf

Download (259kB) | Preview

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.