Child pages
  • Adjacency Transitivity

Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.
Description

Two nodes are considered to be adjacent if there an edge directly between them. A triad is any triple of nodes (actors) (A, B, C). In a directed network there There are sixteen possible kinds of triads in 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).

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 This algorithm must be applied to directed & 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.

...