复杂网络中的壳结构
Structure of shells in complex networks
摘要:
在网络中,我们将外壳$\ell$定义为相对于给定节点处于距离$\ell$的节点的集合,并将$r_\ell$定义为外壳$\ell$外部的节点的分数。在一个传播过程中,信息或疾病通常从一个随机的节点开始扩散,一层一层地到达节点。因此,了解壳层结构对于研究网络的输运性质至关重要。对于一个具有给定度分布的随机连通网络,我们解析地导出了$\ell$外节点的度分布和平均度作为$r_\ell$的函数.进一步,我们发现$r_\ell$遵循迭代函数形式$r_\ell=ϕ(r_{\ell-1})$,其中$ϕ$表示在网络的原始度分布的生成函数。我们的结果可以解释幂律分布的节点数$B_\ell$发现在壳与$\ell$大于网络直径$d$,这是所有节点对之间的平均距离。对于真实世界的网络,$r_\ell$的理论预测偏离经验$r_\ell$。我们引入了一个网络相关函数$c(r_\ell)\equiv r_{\ell+1}/ϕ(r_\ell)$来表征网络中的相关性,其中$r_{\ell+1}$是经验值,$ϕ(r_\ell)$是理论预测值. $c(r_\ell)=1$表明经验结果与理论完全一致。我们将$c(r_\ell)$应用于几个模型和现实世界的网络。我们发现,网络分为两个不同的类:(i)一类{\it poorly-connected}网络与$c(r_\ell)>1$,具有更大的平均距离相比,随机连接的网络具有相同的度分布;和(ii)一类{\it well-connected}网络与$c(r_\ell)<1$。
英文摘要:
In a network, we define shell $\ell$ as the set of nodes at distance $\ell$ with respect to a given node and define $r_\ell$ as the fraction of nodes outside shell $\ell$. In a transport process, information or disease usually diffuses from a random node and reach nodes shell after shell. Thus, understanding the shell structure is crucial for the study of the transport property of networks. For a randomly connected network with given degree distribution, we derive analytically the degree distribution and average degree of the nodes residing outside shell $\ell$ as a function of $r_\ell$. Further, we find that $r_\ell$ follows an iterative functional form $r_\ell=ϕ(r_{\ell-1})$, where $ϕ$ is expressed in terms of the generating function of the original degree distribution of the network. Our results can explain the power-law distribution of the number of nodes $B_\ell$ found in shells with $\ell$ larger than the network diameter $d$, which is the average distance between all pairs of nodes. For real world networks the theoretical prediction of $r_\ell$ deviates from the empirical $r_\ell$. We introduce a network correlation function $c(r_\ell)\equiv r_{\ell+1}/ϕ(r_\ell)$ to characterize the correlations in the network, where $r_{\ell+1}$ is the empirical value and $ϕ(r_\ell)$ is the theoretical prediction. $c(r_\ell)=1$ indicates perfect agreement between empirical results and theory. We apply $c(r_\ell)$ to several model and real world networks. We find that the networks fall into two distinct classes: (i) a class of {\it poorly-connected} networks with $c(r_\ell)>1$, which have larger average distances compared with randomly connected networks with the same degree distributions; and (ii) a class of {\it well-connected} networks with $c(r_\ell)<1$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。