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 (https://doi.org/10.1016/j.laa.2008.09.033)

Preview

Text. Filename: strathprints014343.pdf Accepted Author Manuscript License: 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.

• Share and Export
  

  RDF+XMLBibTeXRIOXX2 XMLRDF+N-TriplesJSONDublin CoreAtomSimple MetadataReferMETSHTML CitationASCII CitationOpenURL ContextObjectEndNoteOpenURL ContextObject in SpanMODSMPEG-21 DIDLEP3 XMLData Cite XMLRIS (EndNote Online, Zotero, Ref manager, etc)RDF+N3Multiline CSV
• Item metadata

  Item type:	Article
  ID code:	14343
  Dates:	Date Event 2009 Published
  Subjects:	Science > Mathematics
  Department:	Faculty of Science > Mathematics and Statistics
  Depositing user:	Mrs Carolynne Westwood
  Date deposited:	22 Jan 2010 10:17
  Last modified:	08 Apr 2024 17:07
  Related URLs:	Journal or Publication
  URI:	https://strathprints.strath.ac.uk/id/eprint/14343