第5行: |
第5行: |
| 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年的著作《社会学:社会形式的调查》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>三元闭包指的是由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年的著作《社会学:社会形式的调查》 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>三元闭包指的是由A,B,C三个节点所组成的三元组的一种性质,即如果A-B和A-C之间存在强联系,则B-C之间也仅存在强联系。 这一性质过于极端,以至于它难以在规模较大、结构复杂的网络中被满足,然而在理解网络与网络预测等方面,它却是一种十分有用的对现实的简化。 |
| | | |
| | | |
| ==History== | | ==History== |
− | 历史<br> | + | ==历史== |
| | | |
| Triadic closure was made popular by [[Mark Granovetter]] in his 1973 article ''The Strength of Weak Ties''.<ref>Granovetter, M. (1973). "[http://www.stanford.edu/dept/soc/people/mgranovetter/documents/granstrengthweakties.pdf The Strength of Weak Ties] {{webarchive|url=https://web.archive.org/web/20080216103216/http://www.stanford.edu/dept/soc/people/mgranovetter/documents/granstrengthweakties.pdf |date=2008-02-16 }}", American Journal of Sociology, Vol. 78, Issue 6, May 1360-80.</ref> 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''.<ref>Granovetter, M. (1973). "[http://www.stanford.edu/dept/soc/people/mgranovetter/documents/granstrengthweakties.pdf The Strength of Weak Ties] {{webarchive|url=https://web.archive.org/web/20080216103216/http://www.stanford.edu/dept/soc/people/mgranovetter/documents/granstrengthweakties.pdf |date=2008-02-16 }}", American Journal of Sociology, Vol. 78, Issue 6, May 1360-80.</ref> 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. |
第15行: |
第15行: |
| 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>'''以及Georg Simmel对社会网络的理解。 一般而言,认知平衡是指两个个体对同一事物具有产生相同感觉的倾向。 如果三个个体所组成的三元组没有闭合,那么与同一个体联系的其余两个个体均将想要闭合这一三元组,进而在关系网络中形成闭包。 |
| | | |
| ==Measurements== | | ==Measurements== |
− | 测量<br> | + | ==测量== |
| | | |
| {{Unreferenced section|date=September 2009}} | | {{Unreferenced section|date=September 2009}} |