Returnability in complex directed networks (digraphs)

Ernesto Estrada, Naomichi Hatano

Research output: Contribution to journalArticle

11 Citations (Scopus)
62 Downloads (Pure)

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.
Original languageEnglish
Pages (from-to)1886-1896
Number of pages10
JournalLinear Algebra and its Applications
Volume490
DOIs
Publication statusPublished - 2009

    Fingerprint

Keywords

  • graph spectrum
  • digraphs
  • estrada index
  • reciprocity
  • complex networks

Cite this