复杂网络中的选择驱动相变
Choice-Driven Phase Transition in Complex Networks
摘要:
我们研究选择驱动的网络增长。在该模型中,节点根据以下过程逐个添加:对于每个添加事件,选择一组目标节点,每个目标节点根据线性优先连接,并且新节点连接到具有最高程度的目标。根据连接规则的精确细节,所产生的网络有三种可能的结果:(i)非普适幂律度分布;(ii)单个宏观枢纽(其度为N阶的节点,网络节点的数量),而其余节点包括非普适幂律度分布;(iii)在情况(i)和(ii)之间的过渡处衰减为(k ln k)^{-2}的度分布。这些属性是强大的,当附件发生的最高程度的节点从至少两个目标。当对一个度不是最高的目标进行连接时,度分布具有超窄的双指数形式exp(-const. x e^k),最大的度仅以ln(ln N)的形式增长。
英文摘要:
We investigate choice-driven network growth. In this model, nodes are added one by one according to the following procedure: for each addition event a set of target nodes is selected, each according to linear preferential attachment, and a new node attaches to the target with the highest degree. Depending on precise details of the attachment rule, the resulting networks has three possible outcomes: (i) a non-universal power-law degree distribution; (ii) a single macroscopic hub (a node whose degree is of the order of N, the number of network nodes), while the remainder of the nodes comprises a non-universal power-law degree distribution; (iii) a degree distribution that decays as (k ln k)^{-2} at the transition between cases (i) and (ii). These properties are robust when attachment occurs to the highest-degree node from at least two targets. When attachment is made to a target whose degree is not the highest, the degree distribution has the ultra-narrow double-exponential form exp(-const. x e^k), from which the largest degree grows only as ln(ln N).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。