Algorithms and Dynamical Models for Communities and Reputation in Social Networks (Springer Theses)

個数：

Algorithms and Dynamical Models for Communities and Reputation in Social Networks (Springer Theses)

Traag, Vincent

ウェブストア価格 ¥22,919（本体¥20,836）
Springer International Publishing AG（2016/09発売）
外貨定価 US$ 109.99
ポイント 208pt

オンデマンド(OD/POD)版です。キャンセルは承れません。

【入荷遅延について】
世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。

◆画像の表紙や帯等は実物とは異なる場合があります。

◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
また、洋書販売価格は、ご注文確定時点での日本円価格となります。
ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。

製本 Paperback:紙装版/ペーパーバック版／ページ数 229 p.
商品コード 9783319360621

Full Description

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.

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.