Scaling laws in emotion-associated words and corresponding network topology
- 250 Downloads
We investigated whether scaling laws were present in the appearance-frequency distribution of emotion-associated words and determined whether the network constructed from those words had small-world or scale-free properties. Over 1,400 participants were asked to write down the first single noun that came to mind in response to nine emotional cue words, resulting in a total of 12,556 responses. We identified Zipf’s law in the distribution of the data, as the slopes of the regression lines reached approximately −1.0 in the appearance frequencies for each emotional cue word. This suggested that the emotion-associated words had a clear regularity, were not randomly generated, were scale-invariant, and were influenced by unification/diversification forces. Thus, we predicted that the emotional intensity of the words might play an important role for a Zipf’s law. Moreover, we also found that the 1-mode network of emotion-associated words clearly had small-world properties in terms of the network topologies of clustering, average distance, and small-worldness value, indicating that all nodes (words) were highly interconnected with each other and were only a few short steps apart. Furthermore, the data suggested the possibility of a scale-free property. Interestingly, we were able to identify hub words with neutral emotional content, such as ‘dog’, ‘woman’, and ‘face’, indicating that these neutral words might be an intermediary between words with conflicting emotional valence. Additionally, efficiency and optimal navigation in terms of complex networks were discussed.
KeywordsEmotion-associated words Zipf’s law Complex networks Small-world Scale-free
This research was supported by the Ministry of Education, Culture, Sports, Science and Technology Grant-in-Aid for Challenging Exploratory Research, 24650140, 2012, awarded to the primary author. We are grateful to Toshio Shibata, Kunio Midzuno, Toru Tazumi, Takanobu Baba, Yosuke Tezuka, Kyoko Yamamoto, and Akemi Takehara for their assistance. We are also grateful to Guston Rankin, Mariko Shirai, and two anonymous reviewers for their extremely valuable comments.
- Bastian M, Heymann S, Jacomy M (2009) Gephi: an open source software for exploring and manipulating networks. Int AAAI Conf Weblogs Soc Media 8:361–362Google Scholar
- Borgatti SP, Everett MG, Freeman LC (2002) Ucinet 6 for windows. Analytic Technologies, HarvardGoogle Scholar
- Ekman P, Friesen WV (1975) Unmasking the face. Prentice Hall, EnglewoodGoogle Scholar
- Knuth DE (1993) The Stanford GraphBase: a platform for combinatorial computing. Addison-Wesley, ReadingGoogle Scholar
- Nesse RM (1990) Evolutionary explanations of emotions. Human Nat 1:261–289Google Scholar
- Öhman A (2008) Fear and anxiety: overlaps and dissociation. In: Lewis M, Haviland-Jones JM, Feldman-Barrett L (eds) Handbook of emotions, 3rd edn. Guilford Press, New York, pp 709–729Google Scholar
- Reisenzein R (2000) The subjective experience of surprise. In: Bless H, Forgas JP (eds) The message within: the role of subjective experience in social cognition and behavior. Psychology Press, Philadelphia, pp 262–279Google Scholar
- Shiota MN, Keltner D (2005) What do emotion words represent? Psychol Inqui 16:32–37Google Scholar
- Zipf GK (1949) Human behavior and the principle of least effort. Addison-Wesley, CambridgeGoogle Scholar