Algorithms And Dynamical Models For Communities And Reputation In Social Networks

Thảo luận trong 'Học tập' bởi ebfree, 23/5/2024.

  1. ebfree

    ebfree Thành viên kỳ cựu

    Tham gia:
    20/5/2024
    Bài viết:
    6,003
    Đã được thích:
    0
    Điểm thành tích:
    86
    Click Here to Download: https://ouo.io/IIcjn9
    [​IMG]
    Algorithms and Dynamical Models for Communities and Reputation in Social Networks
    By: Vincent Traag
    Publisher:
    Springer
    Print ISBN: 9783319063904, 3319063901
    eText ISBN: 9783319063911, 331906391X
    Copyright year: 2014
    Format: EPUB
    Available from $ 109.00 USD
    SKU 9783319063911
    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.
     

    Xem thêm các chủ đề tạo bởi ebfree
    Đang tải...


Chia sẻ trang này