加权网络的自学习互选模型
Self-learning Mutual Selection Model for Weighted Networks
摘要:
本文提出了一个自学习的互选择模型来刻画加权进化网络。通过引入自学习概率$p$和由参数$m$控制的一般的相互选择机制,该模型可以再现在许多实际系统中发现的度、权和强度的无标度分布.仿真结果与理论预测基本一致。有趣的是,我们得到了非平凡的聚类系数$C$和可调程度的可调性$r$,取决于参数$m$和$p$。该模型可以统一表征互反加权网络和互反加权网络。此外,我们发现自我学习可能有助于社交网络的混合。
英文摘要:
In this paper, we propose a self-learning mutual selection model to characterize weighted evolving networks. By introducing the self-learning probability $p$ and the general mutual selection mechanism, which is controlled by the parameter $m$, the model can reproduce scale-free distributions of degree, weight and strength, as found in many real systems. The simulation results are consistent with the theoretical predictions approximately. Interestingly, we obtain the nontrivial clustering coefficient $C$ and tunable degree assortativity $r$, depending on the parameters $m$ and $p$. The model can unify the characterization of both assortative and disassortative weighted networks. Also, we find that self-learning may contribute to the assortative mixing of social networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。