Two nodes are considered to be adjacent if there an edge directly betwee= n them. A triad is any triple of nodes (actors) (A, B, C). There are sixteen possible kinds of triads i= n a directed network. A triad (A, B, C) is said to be transitive if = A and B are adjacent and B and C are adjacent. there is a link (tie) from A to B (AB) and a link from B= to C (BC), then there is also a link from A to C (AC).

=20Transitivity 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 l= ink (DF) would make it transitive.

=20This algorithm must be applied to directed & unweighted networks. Se= lf-loops are ignored.

=20- =20
- Source Code: link =20

Hanneman, Robert A. and Mark Riddle. 2005. Introduction to social networ= k methods. Riverside, CA: University of California, Riverside.

=20http://faculty.ucr.edu/~hanneman/nettext/

= =20
The license could not be verified: License Certificate has expired!=20
Generate a Free license now.