| Description |
1 online resource (xiv, 229 pages) : illustrations (some color) |
| Series |
Springer theses, 2190-5053 |
|
Springer theses, 2190-5053
|
| Contents |
Introduction -- Part I Communities in Networks -- Community Detection -- Scale Invariant Community Detection -- Finding Significant Resolutions -- Modularity with Negative Links -- Applications -- Part II Social Balance & Reputation -- Social Balance -- Models of Social Balance -- Evolution of Cooperation -- Ranking Nodes Using Reputation |
| Summary |
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. 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 |
| Notes |
"Doctoral thesis accepted by the Catholic University of Louvain, Belgium." |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Online resource; title from PDF title page (SpringerLink, viewed June 10, 2014) |
| Subject |
Online social networks -- Mathematical models
|
|
Data mining.
|
|
COMPUTERS -- General.
|
|
Data mining
|
| Form |
Electronic book
|
| ISBN |
9783319063911 |
|
331906391X |
|
