控制贡献识别复杂网络中的顶层驱动节点
Control contribution identifies top driver nodes in complex networks
摘要:
我们提出了一个新的措施来量化的影响,一个节点$i$在控制有向网络。这种度量称为“控制贡献”$\mathcal{C}_{i}$,它将节点$i$出现在一组驱动节点中的概率与其他节点受$i$控制的概率结合起来。为了计算$\mathcal{C}_{i}$,我们提出了一种基于随机样本的最小驱动集的优化方法。使用真实世界和合成网络,我们发现非常广泛的分布$C_{i}$。根据节点的$C_{i}$值对节点进行排名,可以让我们识别出控制大部分网络的顶级驱动节点。我们表明,这种排名是优于基于控制能力或控制范围的排名。我们发现,控制贡献确实包含了新的信息,不能追溯到度,控制能力或控制范围的一个节点。
英文摘要:
We propose a new measure to quantify the impact of a node $i$ in controlling a directed network. This measure, called `control contribution' $\mathcal{C}_{i}$, combines the probability for node $i$ to appear in a set of driver nodes and the probability for other nodes to be controlled by $i$. To calculate $\mathcal{C}_{i}$, we propose an optimization method based on random samples of minimum sets of drivers. Using real-world and synthetic networks, we find very broad distributions of $C_{i}$. Ranking nodes according to their $C_{i}$ values allows us to identify the top driver nodes that control most of the network. We show that this ranking is superior to rankings based on control capacity or control range. We find that control contribution indeed contains new information that cannot be traced back to degree, control capacity or control range of a node.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。