Algorithms and Dynamical Models for Communities and Reputation in Social Networks

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 f...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Traag, Vincent (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2014.
Σειρά:Springer Theses, Recognizing Outstanding Ph.D. Research,
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03279nam a22005175i 4500
001 978-3-319-06391-1
003 DE-He213
005 20151103122046.0
007 cr nn 008mamaa
008 140528s2014 gw | s |||| 0|eng d
020 |a 9783319063911  |9 978-3-319-06391-1 
024 7 |a 10.1007/978-3-319-06391-1  |2 doi 
040 |d GrThAP 
050 4 |a QC1-QC999 
072 7 |a PHU  |2 bicssc 
072 7 |a PBKD  |2 bicssc 
072 7 |a SCI064000  |2 bisacsh 
082 0 4 |a 621  |2 23 
100 1 |a Traag, Vincent.  |e author. 
245 1 0 |a Algorithms and Dynamical Models for Communities and Reputation in Social Networks  |h [electronic resource] /  |c by Vincent Traag. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2014. 
300 |a XIV, 229 p. 40 illus., 19 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Springer Theses, Recognizing Outstanding Ph.D. Research,  |x 2190-5053 
505 0 |a 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. 
520 |a 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. 
650 0 |a Physics. 
650 0 |a Game theory. 
650 0 |a Mathematics. 
650 0 |a Social sciences. 
650 0 |a Economic sociology. 
650 1 4 |a Physics. 
650 2 4 |a Complex Networks. 
650 2 4 |a Game Theory, Economics, Social and Behav. Sciences. 
650 2 4 |a Organizational Studies, Economic Sociology. 
650 2 4 |a Mathematics in the Humanities and Social Sciences. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783319063904 
830 0 |a Springer Theses, Recognizing Outstanding Ph.D. Research,  |x 2190-5053 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-06391-1  |z Full Text via HEAL-Link 
912 |a ZDB-2-PHA 
950 |a Physics and Astronomy (Springer-11651)