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].Georg Simmel, originator of the concept: "Facebook" article at the New York Times website. Retrieved on December 21, 2007. 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 only a strong tie between B-C .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. 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.Easley, D, & Kleinberg, J. (2010). Networks, crowds, and markets: reasoning about a highly connected world. Cornell, NY: Cambridge Univ Pr.
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].Georg Simmel, originator of the concept: "Facebook" article at the New York Times website. Retrieved on December 21, 2007. Triadic closure is the property among three nodes A, B, and C (representing people, for instance), that if the connections A-B and B-C exist , there is a tendency for the new connection A-C to be formed .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. 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.Easley, D, & Kleinberg, J. (2010). Networks, crowds, and markets: reasoning about a highly connected world. Cornell, NY: Cambridge Univ Pr.
R
, such that if a strong tie exists between
(representing people, for instance), that if the connections
R
A-C
B-C exist
R
only a strong tie between B-C
a tendency for the new connection A-C to be formed
R
This property is too extreme to hold true across very large, complex networks, but it is a useful simplification of reality that
Triadic closure
A
the growth of networks, although it is only one of many mechanisms by which new connections are formed in complex