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''].[1] Triadic closure is the property among three nodes A, B, and C (representing people, for instance), that if the connections A-B and A-C exist, there is a tendency for the new connection B-C to be formed.[2] Triadic closure can be used to understand and predict the growth of networks, although it is only one of many mechanisms by which new connections are formed in complex networks.[3]
Triadic closure was made popular by Mark Granovetter in his 1973 article The Strength of Weak Ties.[4] 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
G=(V,E)
N=|V|
M=|E|
di
We can define a triangle among the triple of vertices
i
j
k
We can also define the number of triangles that vertex
i
\delta(i)
\delta(G)=
| 1 | |
| 3 |
\sumi\in \delta(i)
Assuming that triadic closure holds, only two strong edges are required for a triple to form. Thus, the number of theoretical triples that should be present under the triadic closure hypothesis for a vertex
i
\tau(i)=\binom{di}{2}
di\ge2
\tau(G)=
| 1 | |
| 3 |
\sumi\in \tau(i)
Now, for a vertex
i
di\ge2
c(i)
i
i
| \delta(i) | |
| \tau(i) |
C(G)
G
C(G)=
| 1 | |
| N2 |
| \sum | |
| i\inV,di\ge2 |
c(i)
N2
Another measure for the presence of triadic closure is transitivity, defined as
T(G)=
| 3\delta(G) | |
| \tau(G) |
In a trust network, triadic closure is likely to develop due to the transitive property. If a node A trusts node B, and node B trusts node C, node A will have the basis to trust node C. In a social network, strong triadic closure occurs because there is increased opportunity for nodes A and C with common neighbor B to meet and therefore create at least weak ties. Node B also has the incentive to bring A and C together to decrease the latent stress in two separate relationships.[3]
Networks that stay true to this principle become highly interconnected and have very high clustering coefficients. However, networks that do not follow this principle turn out to be poorly connected and may suffer from instability once negative relations are included.
Triadic closure is a good model for how networks will evolve over time. While simple graph theory tends to analyze networks at one point in time, applying the triadic closure principle can predict the development of ties within a network and show the progression of connectivity.[3]
In social networks, triadic closure facilitates cooperative behavior, but when new connections are made via referrals from existing connections the average global fraction of cooperators is less than when individuals choose new connections randomly from the population at large. Two possible effects of these are by the structural and informational construction. The structural construction arises from the propensity toward high clusterability. The informational construction comes from the assumption that an individual knows something about a friend's friend, as opposed to a random stranger.
A node A with strong ties to two neighbors B and C obeys the Strong Triadic Closure Property if these neighbors have an edge (either a weak or strong tie) between them.