arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1611.05604physics.soc-phcs.SI
收藏

竞争领导者之间社交网络的竞争性划分

Consecutive partitions of social networks between rivaling leaders

Malgorzata J. Krawczyk, Krzysztof Kulakowski, Janusz A. Holyst

摘要:

提出了一种模型算法,用于研究描述社会结构的复杂网络的后续划分。分区应该表现为与度大的节点相对应的竞争领导者的行动。分割的条件是两条引线之间的距离至少为三个链接。这确保了每个leader的最近邻层仍然附着在他身上。作为一项规则,数值计算的无标度的阿尔伯特-巴拉巴西网络片段的大小分布显示一个大片段,其中包含原来的领导者(网络的枢纽),和一些小片段的对手,由两个威布尔分布。数值模拟和平均场论揭示了较大碎片尺度的大小是初始网络大小的平方根。该算法应用于美国政治博客的数据。亚当和N. Glance,Proc. WWW-2005)。所获得的片段显然是两极分化的;要么属于民主党,要么属于共和党。

英文摘要:

A model algorithm is proposed to study subsequent partitions of complex networks describing social structures. The partitions are supposed to appear as actions of rivaling leaders corresponding to nodes with large degrees. The condition of a partition is that the distance between two leaders is at least three links. This ensures that the layer of nearest neighbours of each leader remains attached to him. As a rule, numerically calculated size distribution of fragments of scale-free Albert-Barabasi networks reveals one large fragment which contains the original leader (hub of the network), and a number of small fragments with opponents that are described by two Weibull distributions. Numerical simulations and mean-field theory reveal that size of the larger fragment scales as the square root of the initial network size. The algorithm is applied to the data on political blogs in U.S. (L. Adamic and N. Glance, Proc. WWW-2005). The obtained fragments are clearly polarized; either they belong to Democrats, or to the GOP.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑