arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.10027cond-mat.stat-mechcond-mat.dis-nnnlin.AO
收藏

在节点添加与随机连接的增长、随机节点删除的收缩共同作用下演化的网络的结构

The structure of networks that evolve under a combination of growth, via node addition and random attachment, and contraction, via random node deletion

Racah Institute of Physics, The Hebrew University(拉卡物理研究所,希伯来大学)

Barak Budnick, Ofer Biham, Eytan Katzav

AI总结:

本研究构建了结合节点添加随机连接增长与随机节点删除收缩的网络演化模型,通过主方程得到度分布的闭式解,揭示了不同增长收缩平衡参数下度分布的收敛特性与渐近形式。

摘要:

我们给出了在增长(通过节点添加与随机连接)和收缩(通过随机节点删除)共同作用下演化的网络所涌现结构的解析结果。为此,我们考虑了一个网络模型:在每个时间步中,发生节点添加与随机连接步骤的概率为$P_{add}$,发生随机节点删除步骤的概率为$P_{del}=1-P_{add}$。增长与收缩过程之间的平衡由参数$η=P_{add}-P_{del}$刻画。纯网络增长的情况对应$η=1$。当$0<η<1$时,节点添加速率超过节点删除速率,整体过程为网络增长。在相反情况即$-1<η<0$时,整体过程为网络收缩;而在$η=0$的特殊情况下,网络的期望规模除波动外保持恒定。利用主方程,我们得到了随时间变化的度分布$P_t(k)$的闭式表达式。度分布$P_t(k)$包含一个依赖于初始度分布$P_0(k)$的项(该项随时间演化而衰减)以及一个渐近分布$P_{st}(k)$。在纯网络增长($η=1$)的情况下,渐近分布$P_{st}(k)$服从指数分布;而对于$-1<η<1$的情况,它由多个类泊松项之和构成,并呈现类泊松尾。在整体网络增长($0 < η< 1$)的情况下,度分布$P_t(k)$最终会收敛到$P_{st}(k)$。在整体网络收缩($-1 < η< 0$)的情况下,我们识别出两种不同的区域。当$-1/3 < η< 0$时,度分布$P_t(k)$会快速收敛到$P_{st}(k)$;相反,当$-1 < η< -1/3$时,$P_t(k)$的收敛初始阶段非常缓慢,仅在网络即将消失前不久才会趋近于$P_{st}(k)$。

英文摘要:

We present analytical results for the emerging structure of networks that evolve via a combination of growth (by node addition and random attachment) and contraction (by random node deletion). To this end we consider a network model in which at each time step a node addition and random attachment step takes place with probability $P_{add}$ and a random node deletion step takes place with probability $P_{del}=1-P_{add}$. The balance between the growth and contraction processes is captured by the parameter $η=P_{add}-P_{del}$. The case of pure network growth is described by $η=1$. In case that $0<η<1$ the rate of node addition exceeds the rate of node deletion and the overall process is of network growth. In the opposite case, where $-1<η<0$, the overall process is of network contraction, while in the special case of $η=0$ the expected size of the network remains fixed, apart from fluctuations. Using the master equation we obtain a closed form expression for the time dependent degree distribution $P_t(k)$. The degree distribution $P_t(k)$ includes a term that depends on the initial degree distribution $P_0(k)$, which decays as time evolves, and an asymptotic distribution $P_{st}(k)$. In the case of pure network growth ($η=1$) the asymptotic distribution $P_{st}(k)$ follows an exponential distribution, while for $-1<η<1$ it consists of a sum of Poisson-like terms and exhibits a Poisson-like tail. In the case of overall network growth ($0 < η< 1$) the degree distribution $P_t(k)$ eventually converges to $P_{st}(k)$. In the case of overall network contraction ($-1 < η< 0$) we identify two different regimes. For $-1/3 < η< 0$ the degree distribution $P_t(k)$ quickly converges towards $P_{st}(k)$. In contrast, for $-1 < η< -1/3$ the convergence of $P_t(k)$ is initially very slow and it gets closer to $P_{st}(k)$ only shortly before the network vanishes.

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

↑