Triadic closure

Triadic closure

Triadic closure is a concept in social network theory, first suggested by German sociologist Georg Simmel in the early 1900s. [ [http://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.] Supposing that person A has a strong connection to person B and to person C, but there is no connection whatsoever between B and C; when this changes, and B and C become either weakly or strongly linked, there is triadic closure. [ [http://serendip.brynmawr.edu/complexity/course/emergence06/bookreviews/kmaffei.html Working concept] of triadic closure: book review of Duncan Watts' "" at the "Serendip" (Bryn Mawr College) website. Retrieved on December 21 2007.]

Triadic closure was made popular by Mark Granovetter in his 1973 article The Strength of Weak Ties. [Granovetter, M. (1973). " [http://www.stanford.edu/dept/soc/people/mgranovetter/documents/granstrengthweakties.pdf The Strength of Weak Ties] ", American Journal of Sociology, Vol. 78, Issue 6, May 1360-80.] There he synthesized the theory of cognitive balance first introduced by 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.

References


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Mathematical sociology — Sociology …   Wikipedia

  • Социальный граф — На данной анимации показаны в каких отношениях состоят разные социальные объекты. Пользователь Ева находится в дружеских отношениях с пользователями Адам и Кейт, при этом Адам и Кейт не являются друзьями друг другу, но у них есть общий друг Ева.… …   Википедия

  • Social network — For other uses, see Social network (disambiguation). Sociology …   Wikipedia

  • Watts and Strogatz model — The Watts and Strogatz model is a random graph generation model that produces graphs with small world properties, including short average path lengths and high clustering. It was proposed by Duncan J. Watts and Steven Strogatz in their joint 1998 …   Wikipedia

  • Sign (semiotics) — In semiotics, a sign is something that stands for something else, to someone in some capacity [Marcel Danesi and Paul Perron, Analyzing Cultures .] . It may be understood as a discrete unit of meaning, and includes words, images, gestures, scents …   Wikipedia

  • Tonality — This article is about the musical system. For linguistic feature, see Tone (linguistics). Perfect authentic cadence (IV64 V7 I progression) in C   …   Wikipedia

  • Hegel’s logic and philosophy of mind — Willem deVries LOGIC AND MIND IN HEGEL’S PHILOSOPHY Hegel is above all a systematic philosopher. Awe inspiring in its scope, his philosophy left no subject untouched. Logic provides the central, unifying framework as well as the general… …   History of philosophy

  • Social comparison theory — Social comparison is a theory initially proposed by social psychologist Leon Festinger in 1954. This theory explains how individuals evaluate their own opinions and desires by comparing themselves to others. Basic Framework The Social comparison… …   Wikipedia

  • Binary relation — Relation (mathematics) redirects here. For a more general notion of relation, see Finitary relation. For a more combinatorial viewpoint, see Theory of relations. In mathematics, a binary relation on a set A is a collection of ordered pairs of… …   Wikipedia

  • Romanian philosophy — is a name covering either a) the philosophy done in Romania or by Romanians, or b) an ethnic philosophy, which expresses at a high level the fundamental features of the Romanian spirituality, or which elevates to a philosophical level the… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”