CIShell Manual : Dyad Reciprocity
This page last changed on Feb 03, 2011 by pataphil.
DescriptionA 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 is the ratio of reciprocal relationships in the network to the total number of dyads with any kind of relationship (reciprocal or otherwise).
Usage HintsAlgorithm 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. Links
ReferencesHanneman, Robert A. and Mark Riddle. 2005. Introduction to social network methods. Riverside, CA: University of California, Riverside. http://faculty.ucr.edu/~hanneman/nettext/ See Also |
![]() |
Document generated by Confluence on May 31, 2011 16:37 |