更改

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 only a 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 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 only a 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.

'''<font color="#FF8000">三合闭包 Triadic Closure </font>'''是'''<font color="#FF8000">社会网络理论 Social Network Theory </font>'''中的一个概念，最早由德国社会学家格奥尔格·西梅尔（Georg Simmel）在其1908年的著作《社会学：社会形式的调查》中提出。 三元闭合是三个节点A，B和C之间的属性，因此，如果A-B和A-C之间存在牢固的联系，则B-C之间仅存在牢固的联系。 这个属性太极端了，无法在非常大的复杂网络中实现，但是它是对现实的有用简化，可以用来理解和预测网络。

'''<font color="#FF8000">三合闭包 Triadic Closure </font>'''是'''<font color="#FF8000">社会网络理论 Social Network Theory </font>'''中的一个概念，最早由德国社会学家格奥尔格·西梅尔（Georg Simmel）在其1908年的著作《社会学：社会形式的调查》中提出。 三元闭合是三个节点A，B和C之间的属性，因此，如果A-B和A-C之间存在牢固的联系，则B-C之间仅存在牢固的联系。 这个属性太极端了，无法在非常大的'''<font color="#FF8000">复杂网络 Complex Network </font>'''中实现，但是它是对现实的有用简化，可以用来理解和预测网络。

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.

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.

马克·格兰诺维特（Mark Granovetter）在其1973年的文章《弱结的力量》（The Strength of Weak Ties）中使三元闭包变得流行。 在那里，他综合了弗里茨·海德（Fritz Heider）于1946年提出的'''<font color="#FF8000">认知平衡理论 The Theory Of Cognitive Balance </font>'''，该理论对Simmelian的社交网络有所了解。 一般而言，认知平衡是指两个人想对一个物体感觉相同的倾向。 如果没有关闭三个人的闭合，那么连接到两个人的人都将要关闭，以便在关系网络中实现闭合。

马克·格兰诺维特（Mark Granovetter）在其1973年的文章《弱链接的力量》（The Strength of Weak Ties）中使三元闭包变得流行。 在那里，他综合了弗里茨·海德（Fritz Heider）于1946年提出的'''<font color="#FF8000">认知平衡理论 The Theory Of Cognitive Balance </font>'''，该理论对Simmelian的社交网络有所了解。 一般而言，认知平衡是指两个人想对一个物体感觉相同的倾向。 如果没有关闭三个人的闭合，那么连接到两个人的人都将要关闭，以便在关系网络中实现闭合。

==Measurements==

==Measurements==

{{Unreferenced section|date=September 2009}}

{{Unreferenced section|date=September 2009}}

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

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===

===Clustering coefficient===