Traag V. Algorithms and Dynamical Models for Communities and Reputation in Social Networks

Springer, 2014. — 237 p. — (Springer Theses). — ISBN 978-3-319-06390-4.A persistent problem when finding communities in large complex networks is the so-called resolution limit. This thesis addresses this issue meticulously, and introduces the important notion of resolution-limit-free. Remarkably, only few methods possess this desirable property, and this thesis puts forward one such method. Moreover, it discusses how to asses whether communities can occur by chance or not. One aspect that is often ignored in this field is treated here: links can also be negative, as in war or conflict.Communities in Networks
Community Detection
Scale Invariant Community Detection
Finding Significant Resolutions
Modularity with Negative Links
Applications
Social Balance and Reputation
Social Balance
Models of Social Balance
Evolution of Cooperation
Ranking Nodes Using Reputation