Returnability in complex directed networks (digraphs)

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

[img]
Preview
 Text (strathprints014343)
strathprints014343.pdf
Accepted Author Manuscript
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo
Download (206kB)| 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.

    Author(s):Estrada, Ernesto ORCID logoORCID: https://orcid.org/0000-0002-3066-7418 and Hatano, Naomichi
    Item type:Article
    ID code:14343
    Keywords:graph spectrum, digraphs, estrada index, reciprocity, complex networks, Mathematics, Discrete Mathematics and Combinatorics, Algebra and Number Theory, Geometry and Topology, Numerical Analysis
    Subjects:Science > Mathematics
    Department:Faculty of Science > Mathematics and Statistics
    Depositing user: Mrs Carolynne Westwood
    Date deposited:22 Jan 2010 10:17
    Last modified:29 Nov 2019 05:34
    Related URLs:
    URI:https://strathprints.strath.ac.uk/id/eprint/14343
    Export data:
    CORE (COnnecting REpositories)