更改

'''Triadic closure''' is a concept in [[social network]] theory, first suggested by [[Germany|German]] [[sociology|sociologist]] [[Georg Simmel]] in his 1908 book ''Soziologie'' [''Sociology: Investigations on the Forms of Sociation''].<ref>[https://www.nytimes.com/2007/12/17/style/17facebook.html?pagewanted=print Georg Simmel], originator of the concept: "Facebook" article at [[the New York Times]] website. Retrieved on December 21, 2007.</ref> 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.<ref>[https://serendipstudio.org/complexity/course/emergence06/bookreviews/kmaffei.html 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.</ref> 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.<ref name=Easley>Easley, D, & Kleinberg, J. (2010). Networks, crowds, and markets: reasoning about a highly connected world. Cornell, NY: Cambridge Univ Pr.</ref>

'''Triadic closure''' is a concept in [[social network]] theory, first suggested by [[Germany|German]] [[sociology|sociologist]] [[Georg Simmel]] in his 1908 book ''Soziologie'' [''Sociology: Investigations on the Forms of Sociation''].<ref>[https://www.nytimes.com/2007/12/17/style/17facebook.html?pagewanted=print Georg Simmel], originator of the concept: "Facebook" article at [[the New York Times]] website. Retrieved on December 21, 2007.</ref> 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.<ref>[https://serendipstudio.org/complexity/course/emergence06/bookreviews/kmaffei.html 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.</ref> 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.<ref name=Easley>Easley, D, & Kleinberg, J. (2010). Networks, crowds, and markets: reasoning about a highly connected world. Cornell, NY: Cambridge Univ Pr.</ref>