For example: a Person ( P {\displaystyle P} ) who likes ( + {\displaystyle +} ) an Other ( O {\displaystyle O} ) person will be balanced by the same valence attitude on behalf of the other. Symbolically, P ( + ) > O {\displaystyle P(+)>O} and P < ( + ) O {\displaystyle P<(+)O} results in psychological balance.
This can be extended to things or objects ( X {\displaystyle X} ) as well, thus introducing triadic relationships. If a person P {\displaystyle P} likes object X {\displaystyle X} but dislikes other person O {\displaystyle O} , what does P {\displaystyle P} feel upon learning that person O {\displaystyle O} created the object X {\displaystyle X} ? This is symbolized as such:
Cognitive balance is achieved when there are three positive links or two negatives with one positive. Two positive links and one negative like the example above creates imbalance or cognitive dissonance.
Multiplying the signs shows that the person will perceive imbalance (a negative multiplicative product) in this relationship, and will be motivated to correct the imbalance somehow. The Person can either:
Any of these will result in psychological balance, thus resolving the dilemma and satisfying the drive. (Person P {\displaystyle P} could also avoid object X {\displaystyle X} and other person O {\displaystyle O} entirely, lessening the stress created by psychological imbalance.)
To predict the outcome of a situation using Heider's balance theory, one must weigh the effects of all the potential results, and the one requiring the least amount of effort will be the likely outcome.
Determining if the triad is balanced is simple math:
+ + + = + {\displaystyle +++=+} ; Balanced.
− + − = + {\displaystyle -+-=+} ; Balanced.
− + + = − {\displaystyle -++=-} ; Unbalanced.
Balance theory is useful in examining how celebrity endorsement affects consumers' attitudes toward products.6 If a person likes a celebrity and perceives (due to the endorsement) that said celebrity likes a product, said person will tend to like the product more, in order to achieve psychological balance.
However, if the person already had a dislike for the product being endorsed by the celebrity, they may begin disliking the celebrity, again to achieve psychological balance.
Heider's balance theory can explain why holding the same negative attitudes of others promotes closeness.7: 171 See The enemy of my enemy is my friend.
Dorwin Cartwright and Frank Harary looked at Heider's triads as 3-cycles in a signed graph. The sign of a path in a graph is the product of the signs of its edges. They considered cycles in a signed graph representing a social network.
Harary proved that a balanced graph is polarized, that is, it decomposes into two entirely positive subgraphs that are joined by negative edges.8
In the interest of realism, a weaker property was suggested by Davis:9
Graphs with this property may decompose into more than two entirely positive subgraphs, called clusters.10: 179 The property has been called the clusterability axiom.11 Then balanced graphs are recovered by assuming the
The significance of balance theory for social dynamics was expressed by Anatol Rapoport:
Note that a triangle of three mutual enemies makes a clusterable graph but not a balanced one. Therefore, in a clusterable network one cannot conclude that "the enemy of my enemy is my friend," although this aphorism is a fact in a balanced network.
Claude Flament13 expressed a limit to balance theory imposed by reconciling weak ties with relationships of stronger force such as family bonds:
At the 1975 Dartmouth College colloquium on balance theory, Bo Anderson struck at the heart of the notion:14
Heider, Fritz (1946). "Attitudes and Cognitive Organization". The Journal of Psychology. 21: 107–112. doi:10.1080/00223980.1946.9917275. PMID 21010780. /wiki/Fritz_Heider ↩
Heider, Fritz (1958). The Psychology of Interpersonal Relations. John Wiley & Sons. ↩
Chiang, Y. S.; Chen, Y. W.; Chuang, W. C.; Wu, C. I.; Wu, C. T. (2020). "Triadic balance in the brain: Seeking brain evidence for Heider's structural balance theory". Social Networks. 63: 80–90. doi:10.1016/j.socnet.2020.05.003. /wiki/Social_Networks ↩
Cartwright, D.; Harary, Frank (1956). "Structural balance: a generalization of Heider's theory" (PDF). Psychological Review. 63 (5): 277–293. doi:10.1037/h0046049. PMID 13359597. Archived (PDF) from the original on 2020-12-01. Retrieved 2020-12-04. https://snap.stanford.edu/class/cs224w-readings/cartwright56balance.pdf ↩
Paul W. Holland & Samuel Leinhardt (editors) (1979) Perspectives on Social Network Research, Academic Press ISBN 9780123525505 /wiki/Paul_W._Holland ↩
John C. Mowen and Stephen W. Brown (1981), "On Explaining and Predicting the Effectiveness of Celebrity Endorsers", in Advances in Consumer Research Volume 08, eds. Kent B. Monroe, Advances in Consumer Research Volume 08: Association for Consumer Research, Pages: 437-441. ↩
Gary Chartrand (1977) Graphs as Mathematical Models, chapter 8: Graphs and Social Psychology, Prindle, Webber & Schmidt, ISBN 0-87150-236-4 /wiki/Gary_Chartrand ↩
Frank Harary (1953) On the Notion of Balance of a Signed Graph Archived 2018-06-02 at the Wayback Machine, Michigan Mathematical Journal 2(2): 153–6 via Project Euclid MR0067468 /wiki/Frank_Harary ↩
James A. Davis (May 1967) "Clustering and structural balance in graphs", Human Relations 20:181–7 /wiki/James_A._Davis ↩
Claude Flament (1979) "Independent generalizations of balance", in Perspectives on Social Network Research ↩
Anatol Rapoport (1963) "Mathematical models of social interaction", in Handbook of Mathematical Psychology, v. 2, pp 493 to 580, especially 541, editors: R.A. Galanter, R.R. Lace, E. Bush, John Wiley & Sons /wiki/Anatol_Rapoport ↩
Claude Flament (1963) Application of Graph Theory to Group Structure, translators Maurice Pinard, Raymond Breton, Fernand Fontaine, chapter 3: Balancing Processes, page 92, Prentice-Hall /wiki/Prentice-Hall ↩
Bo Anderson (1979) "Cognitive Balance Theory and Social Network Analysis: Remarks on some fundamental theoretical matters", pages 453 to 69 in Perspectives on Social Network Research, see page 462. ↩