Child pages
  • Dyad Reciprocity

Versions Compared


  • This line was added.
  • This line was removed.
  • Formatting was changed.
Comment: Migrated to Confluence 5.3


A dyad is defined as any pair of nodes (A, B). In a directed network, a dyad is said to have a reciprocal relationship if there exists an edge from A to B and from B to A. The reciprocity of any given node N is the ratio of reciprocal relationships N is in the network to the total number of dyads with any kind of relationship (reciprocal or otherwise).


Algorithm must be applied to directed networks. Self-loops are ignored in the calculation.

This is global calculation for the input network, and as such the results are simply reported on the Console window.