CIShell Manual : Adjacency Transitivity
This page last changed on Feb 03, 2011 by jrbibers.
DescriptionTwo nodes are considered to be adjacent if there an edge directly between them. A triad is any triple of nodes (actors) (A, B, C). Transitivity is defined as the ratio of number of transitive triads (AB, BC and AC) to the total number of those triads (DE and EF) where a third link (DF) would make it transitive. Usage HintsThis algorithm must be applied to directed & unweighted networks. Self-loops are ignored. 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 |