Returnability in complex directed networks (digraphs)

Ernesto Estrada, Naomichi Hatano

Research output: Contribution to journalArticle

10 Citations (Scopus)

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.
LanguageEnglish
Pages1886-1896
Number of pages10
JournalLinear Algebra and its Applications
Volume490
DOIs
Publication statusPublished - 2009

Fingerprint

Directed Network
Digraph
Complex Networks
Reciprocity
Closed
Concepts

Keywords

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

Cite this

Estrada, Ernesto ; Hatano, Naomichi. / Returnability in complex directed networks (digraphs). In: Linear Algebra and its Applications. 2009 ; Vol. 490. pp. 1886-1896.
@article{7aa331615083419d89002545f8a7d32e,
title = "Returnability in complex directed networks (digraphs)",
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.",
keywords = "graph spectrum, digraphs, estrada index, reciprocity, complex networks",
author = "Ernesto Estrada and Naomichi Hatano",
year = "2009",
doi = "10.1016/j.laa.2008.09.033",
language = "English",
volume = "490",
pages = "1886--1896",
journal = "Linear Algebra and its Applications",
issn = "0024-3795",

}

Returnability in complex directed networks (digraphs). / Estrada, Ernesto; Hatano, Naomichi.

In: Linear Algebra and its Applications, Vol. 490, 2009, p. 1886-1896.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Returnability in complex directed networks (digraphs)

AU - Estrada, Ernesto

AU - Hatano, Naomichi

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - graph spectrum

KW - digraphs

KW - estrada index

KW - reciprocity

KW - complex networks

UR - http://www.sciencedirect.com/science/journal/00243795

U2 - 10.1016/j.laa.2008.09.033

DO - 10.1016/j.laa.2008.09.033

M3 - Article

VL - 490

SP - 1886

EP - 1896

JO - Linear Algebra and its Applications

T2 - Linear Algebra and its Applications

JF - Linear Algebra and its Applications

SN - 0024-3795

ER -