具有枢纽吸引行为的复杂网络分形无标度模型
A Fractal and Scale-free Model of Complex Networks with Hub Attraction Behaviors
摘要:
人们普遍认为复杂网络的分形性起源于枢纽排斥行为(节点排斥关系或排斥性),即度大的节点倾向于与度小的节点连接。这一假设被一个动态增长模型所证明,该模型的演化过程是Song等人提出的逆重整化过程。现在我们发现,动态增长模型是基于这样一个假设,即所有的跨盒链接都有相同的概率e链接到每个盒子内的最连通节点。因此,我们通过采用灵活的概率e来修改增长模型,使枢纽与枢纽的连接概率高于非枢纽。利用该模型,我们发现一些分形和无标度网络具有枢纽吸引行为(相关性或同配性)。结果是以前的信念的反例。
英文摘要:
It is widely believed that fractality of complex networks origins from hub repulsion behaviors (anticorrelation or disassortativity), which means large degree nodes tend to connect with small degree nodes. This hypothesis was demonstrated by a dynamical growth model, which evolves as the inverse renormalization procedure proposed by Song et al. Now we find that the dynamical growth model is based on the assumption that all the cross-boxes links has the same probability e to link to the most connected nodes inside each box. Therefore, we modify the growth model by adopting the flexible probability e, which makes hubs have higher probability to connect with hubs than non-hubs. With this model, we find some fractal and scale-free networks have hub attraction behaviors (correlation or assortativity). The results are the counter-examples of former beliefs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。