Generalization of clustering coefficients to signed correlation networks.
The recent interest in network analysis applications in personality psychology and psychopathology has put forward new methodological challenges. Personality and psychopathology networks are typically based on correlation matrices and therefore include both positive and negative edge signs. However,...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Public Library of Science (PLoS)
2014
|
| Subjects: | |
| Online Access: | https://doaj.org/article/5da1566a8a4a44789a1593fc7d4f0071 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The recent interest in network analysis applications in personality psychology and psychopathology has put forward new methodological challenges. Personality and psychopathology networks are typically based on correlation matrices and therefore include both positive and negative edge signs. However, some applications of network analysis disregard negative edges, such as computing clustering coefficients. In this contribution, we illustrate the importance of the distinction between positive and negative edges in networks based on correlation matrices. The clustering coefficient is generalized to signed correlation networks: three new indices are introduced that take edge signs into account, each derived from an existing and widely used formula. The performances of the new indices are illustrated and compared with the performances of the unsigned indices, both on a signed simulated network and on a signed network based on actual personality psychology data. The results show that the new indices are more resistant to sample variations in correlation networks and therefore have higher convergence compared with the unsigned indices both in simulated networks and with real data. |
|---|