Triadic closure

Triadic closure is a concept in social network theory, first suggested by German sociologist Georg Simmel in his 1908 book Soziologie [Sociology: Investigations on the Forms of Sociation]. Triadic closure is the property among three nodes A, B, and C, such that if a strong tie exists between A-B and A-C, there is a weak or strong tie between B-C. This property is too extreme to hold true across very large, complex networks, but it is a useful simplification of reality that can be used to understand and predict networks.

Triadic closure was made popular by Mark Granovetter in his 1973 article The Strength of Weak Ties. There he synthesized the theory of cognitive balance first introduced by Fritz Heider in 1946 with a Simmelian understanding of social networks. In general terms, cognitive balance refers to the propensity of two individuals to want to feel the same way about an object. If the triad of three individuals is not closed, then the person connected to both of the individuals will want to close this triad in order to achieve closure in the relationship network.

The two most common measures of triadic closure for a graph are (in no particular order) the clustering coefficient and transitivity for that graph.

One measure for the presence of triadic closure is clustering coefficient, as follows:

Let ${\displaystyle G=(V,E)}$ be an undirected simple graph (i.e., a graph having no self-loops or multiple edges) with V the set of vertices and E the set of edges. Also, let ${\displaystyle N=|V|}$ and ${\displaystyle M=|E|}$ denote the number of vertices and edges in G, respectively, and let ${\displaystyle d_{i}}$ be the degree of vertex i.

...
Wikipedia