随机网络中的流言
Gossip in random networks
摘要：
我们考虑在给定的社交网络中被告知八卦的平均概率X。该网络是在鄂尔多斯和仁义的随机图论建模。在这个理论中，一个网络的特点是两个参数：大小N和链接概率P。我们的实验数据表明，友谊的社会包容性的三个层次。临界值p_c（一半的代理被告知）与系统大小成比例，即N^{-γ}，γ \approx为0.68。计算机模拟表明，概率X随p呈S形曲线变化。邻居之间的相关性的影响也进行了评估：随着聚类系数C的增加，X减小。
英文摘要：
We consider the average probability X of being informed on a gossip in a given social network. The network is modeled within the random graph theory of Erdos and Renyi. In this theory, a network is characterized by two parameters: the size N and the link probability p. Our experimental data suggest three levels of social inclusion of friendship. The critical value p_c, for which half of agents are informed, scales with the system size as N^{-γ} with γ\approx 0.68. Computer simulations show that the probability X varies with p as a sigmoidal curve. Influence of the correlations between neighbors is also evaluated: with increasing clustering coefficient C, X decreases.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
