Algorithms and Dynamical Models for Communities and Reputation in Social Networks

ebook Springer Theses

By Vincent Traag

cover image of Algorithms and Dynamical Models for Communities and Reputation in Social Networks

Sign up to save your library

With an OverDrive account, you can save your favorite libraries for at-a-glance information about availability. Find out more about OverDrive accounts.

   Not today
Libby_app_icon.svg

Find this title in Libby, the library reading app by OverDrive.

app-store-button-en.svg play-store-badge-en.svg
LibbyDevices.png

Search for a digital library with this title

Title found at these libraries:

Loading...
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 assess 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. Besides how to incorporate this in community detection, it also examines the dynamics of such negative links, inspired by a sociological theory known as social balance. This has intriguing connections to the evolution of cooperation, suggesting that for cooperation to emerge, groups often split in two opposing factions. In addition to these theoretical contributions, the thesis also contains an empirical analysis of the effect of trading communities on international conflict, and how communities form in a citation network with positive and negative links.
Algorithms and Dynamical Models for Communities and Reputation in Social Networks