|
Triadic closure is a simple and effective mathematical model of homophily in a network. The basic idea is illustrated below:
Nodes 2 and 3 share a mutual
neighbor but are not adjacent. |
Adding edge {2,3} is then
an example of triadic closure. |
Triadic closure usually occurs in the context of a larger graph. For example, in the graph below--considering only the solid black lines as edges--there are many possible opportunities for triadic closure. Just a few of those possible opportunities are illustrated with dotted red lines.
|
