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

社交网络中决策和交流的熟人角色

Acquaintance role for decision making and exchanges in social networks

Elena Agliari, Adriano Barra, Raffaella Burioni, Pierluigi Contucci

摘要:

我们通过随机图来建模社交网络,该随机图的节点代表代理,其中两个代理之间的链接代表互惠交互;每个代理还与代表二分观点或属性的二元变量相关联。我们考虑两种情况下的成对(p=2)和多个(p>2)代理之间的相互作用,我们研究所产生的系统的行为通过能量熵方案,典型的统计力学方法。我们通过分析和数值计算表明,社会网络的连通性起着重要的作用:而对于成对交互(p=2),连通性的权重是线性的,当交互涉及的代理数量大于2(p>2)时,它的权重变得越来越重要。因此,当p较大时,系统内的完全一致性可以在相对于通常分析的p=2的情况的相对较小的临界耦合处达到,或者换句话说,代理之间相对较小的耦合强度足以定向系统的大部分。

英文摘要:

We model a social network by a random graph whose nodes represent agents and links between two of them stand for a reciprocal interaction; each agent is also associated to a binary variable which represents a dichotomic opinion or attribute. We consider both the case of pair-wise (p=2) and multiple (p>2) interactions among agents and we study the behavior of the resulting system by means of the energy-entropy scheme, typical of statistical mechanics methods. We show, analytically and numerically, that the connectivity of the social network plays a non-trivial role: while for pair-wise interactions (p=2) the connectivity weights linearly, when interactions involve contemporary a number of agents larger than two (p>2), its weight gets more and more important. As a result, when p is large, a full consensus within the system, can be reached at relatively small critical couplings with respect to the p=2 case usually analyzed, or, otherwise stated, relatively small coupling strengths among agents are sufficient to orient most of the system.

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

↑