Child pages
  • Adjacency Transitivity
Skip to end of metadata
Go to start of metadata

You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 4 Next »

Description

A triad is any triple of nodes (actors) (A, B, C). In a directed network there are sixteen possible kinds of triads. A triad is said to be transitive if 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).

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.

Pros & Cons

...

Applications

...

Implementation Details

...

Usage Hints

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

  • Source Code: link
  • Home Page: ...
Acknowledgments

...

References

Hanneman, 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

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

  • No labels