Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

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)
Download (252Kb) | 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.

    Item type: Article
    ID code: 14343
    Keywords: graph spectrum, digraphs, estrada index, reciprocity, complex networks, Mathematics
    Subjects: Science > Mathematics
    Department: Faculty of Science > Mathematics and Statistics
    Related URLs:
      Depositing user: Mrs Carolynne Westwood
      Date Deposited: 22 Jan 2010 10:17
      Last modified: 19 Mar 2012 01:15
      URI: http://strathprints.strath.ac.uk/id/eprint/14343

      Actions (login required)

      View Item

      Fulltext Downloads: