Triadic closure

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Triadic closure is a concept in social network theory, first suggested by German sociologist Georg Simmel in the early 1900s.[1] 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.[2] 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.[3]

History[edit]

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.

Measurements[edit]

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

Clustering coefficient[edit]

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

Let 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 N = |V| and M = |E| denote the number of vertices and edges in G, respectively, and let d_i be the degree of vertex i.

Then we can define a triangle among the triple of vertices i, j, and k to be a set with the following three edges: {(i,j), (j,k), (i,k)}. Then we can define the number of triangles that vertex i is involved in as \delta (i) and, as each triangle is counted three times, we can express the number of triangles in G as \delta (G) = \frac{1}{3} \sum_{i\in V} \ \delta (i). Assuming that triadic closure holds, only two strong edges are required for a triple to form and the number of triples of vertex i is \tau (i) = \binom{d_i}{2}, assuming d_i \ge 2. Thus we can express \tau (G) = \frac{1}{3} \sum_{i\in V} \ \tau (i).

Now, for a vertex i with d_i \ge 2, the clustering coefficient c(i) of vertex i is the fraction of triples for vertex i that are closed, and can be measured as \frac{\delta (i)}{\tau (i)}. Thus, the clustering coefficient C(G) of graph G is given by C(G) = \frac {1}{N_2} \sum_{i \in V, d_i \ge 2} c(i), where N_2 is the number of nodes with degree at least 2.

Transitivity[edit]

Another measure for the presence of triadic closure is transitivity, defined as T(G) = \frac{3\delta (G)}{\tau (G)}.

Causes and effects[edit]

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 for this 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.

Strong Triadic Closure Property and local bridges[edit]

Strong Triadic Closure Property is that if a node has strong ties to two neighbors, then these neighbors must have at least a weak tie between them. A local bridge occurs, on the other hand, when a node is acting as a gatekeeper between two neighboring nodes who are not otherwise connected. In a network that follows the Strong Triadic Closure Property, one of the ties between nodes involved in a local bridge needs to be a weak tie.

Proof by contradiction[edit]

Let node B be a local bridge between nodes A and C such that there is no weak tie between the nodes involved. Therefore B has a strong tie to both A and C. By the definition of Strong Triadic Closure, a weak tie would develop between nodes A and C. However, this contradicts the fact that B is a local gatekeeper. Thus at least one of the nodes involved in a local bridge needs to be a weak tie to prevent triadic closure from occurring.[3]

References[edit]

  1. ^ Georg Simmel, originator of the concept: "Facebook" article at the New York Times website. Retrieved on December 21, 2007.
  2. ^ Working concept of triadic closure: book review of Duncan Watts' "Six Degrees: The Science of a Connected Age" at the Serendip (Bryn Mawr College) website. Retrieved on December 21, 2007.
  3. ^ a b c d Easley, D, & Kleinberg, J. (2010). Networks, crowds, and markets: reasoning about a highly connected world. Cornell, NY: Cambridge Univ Pr.
  4. ^ Granovetter, M. (1973). "The Strength of Weak Ties", American Journal of Sociology, Vol. 78, Issue 6, May 1360-80.