In
social network theory, social relationships are viewed in terms of
nodes and
ties. Nodes are the individual actors within the networks, and ties are the relationships between the actors. There can be many kinds of ties between the nodes. In its simplest form, a social network is a map of all of the relevant ties between the nodes being studied.
Weak tie hypothesis The "weak tie hypothesis" argues, using a combination of
probability and mathematics, as originally stated by
Anatol Rapoport in 1957, that if A is linked to both B and C, then there is a greater-than-chance probability that B and C are linked to each other: That is, if we consider any two randomly selected individuals, such as A and B, from the set S = A, B, C, D, E, ..., of all persons with ties to either or both of them, then, for example, if A is strongly tied to both B and C, then according to probability arguments, the B–C tie is always present. The absence of the B–C tie, in this situation, would create, according to Granovetter, what is called the
forbidden triad. In other words, the B–C tie, according to this logic, is always present, whether weak or strong, given the other two strong ties. In this direction, the "weak tie hypothesis" postulates that clumps or
cliques of social structure will form, being bound predominately by "strong ties", and that "weak ties" will function as the crucial bridge between any two densely knit clumps of close friends. It may follow that individuals with few bridging weak ties will be deprived of information from distant parts of the
social system and will be confined to the provincial news and views of their close friends. However, having a large number of weak ties can mean that novel information is effectively "swamped" among a high volume of information, even crowding out strong ties. The arrangement of links in a network may matter as well as the number of links. Further research is needed to examine the ways in which types of information, numbers of ties, quality of ties, and trust levels interact to affect the spreading of information. there are some problems in the Granovetter definition. The first one refers to the fact that the Granovetter definition of the strength of a tie is a curvilinear prediction and his question is "how do we know where we are on this theoretical curve?". The second one refers to the effective character of strong ties. Krackhardt says that there are subjective criteria in the definition of the strength of a tie such as emotional intensity and the intimacy. He thought that strong ties are very important in severe changes and uncertainty: He called this particular type of strong tie
philo and define
philos relationship as one that meets the following three necessary and sufficient conditions: •
Interaction: For A and B to be
philos, A and B must interact with each other. •
Affection: For A and B to be
philos, A must feel affection for B. •
Time: A and B, to be
philos, must have a history of interactions with each other that have lasted over an extended period of time. The combination of these qualities predicts trust and predicts that strong ties will be the critical ones in generating trust and discouraging malfeasance. When it comes to major change, change that may threaten the status quo in terms of power and the standard routines of how decisions are made, then trust is required. Thus, change is the product of
philos.
Positive ties and negative ties Starting in the late 1940s,
Anatol Rapoport and others developed a probabilistic approach to the characterization of large social networks in which the nodes are persons and the links are acquaintanceship. During these years, formulas were derived that connected local parameters such as closure of contacts, and the supposed existence of the B–C tie to the global network property of connectivity. which was published by
Frank Harary in 1953. A signed graph is called
balanced if the product of the signs of all relations in every
cycle is positive. A signed graph is unbalanced if the product is ever negative. The theorem says that if a network of interrelated positive and negative ties is balanced, then it consists of two subnetworks such that each has positive ties among its nodes and negative ties between nodes in distinct subnetworks. In other words, "my friend's enemy is my enemy". The imagery here is of a social system that splits into two
cliques. There is, however, a special case where one of the two subnetworks may be empty, which might occur in very small networks. In these two developments, we have mathematical models bearing upon the analysis of the structure. Other early influential developments in mathematical sociology pertained to process. For instance, in 1952
Herbert A. Simon produced a mathematical formalization of a published theory of social groups by constructing a model consisting of a deterministic system of differential equations. A formal study of the system led to theorems about the dynamics and the implied
equilibrium states of any group.
Absent or invisible ties In a footnote,
Mark Granovetter defines what he considers as absent ties: The concept of
invisible tie was proposed to overcome the contradiction between the adjective "absent" and this definition, which suggests that such ties exist and might "usefully be distinguished" from the absence of ties. ==The individualistic perspective==