arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.1603physics.soc-phcond-mat.stat-mechcs.SI
收藏

复杂网络上的最优搜索策略

Optimal search strategies on complex networks

Francesca Di Patti, Duccio Fanelli, Francesco Piazza

摘要:

复杂网络在自然界中无处不在,在许多环境中发挥着至关重要的作用。互联网和网络世界渗透在我们的日常生活中,是自组织的层次图。城市交通流在复杂的道路网络上流动,这对交通设计和疫情控制都有影响。在大脑中,神经元通过异质连接连接,支持电信号的传播。在所有这些情况下,真正的挑战是揭示特定动态特征由网络底层拓扑调制的机制。在这里,我们考虑代理随机跳沿图的链接,与执行远程跳到随机选择的断开连接的节点具有给定的概率的额外的可能性。我们表明,存在的两个跳跃规则的最佳组合,最大限度地提高目标搜索的效率,最佳的网络拓扑结构。

英文摘要:

Complex networks are ubiquitous in nature and play a role of paramount importance in many contexts. Internet and the cyberworld, which permeate our everyday life, are self-organized hierarchical graphs. Urban traffic flows on intricate road networks, which impact both transportation design and epidemic control. In the brain, neurons are cabled through heterogeneous connections, which support the propagation of electric signals. In all these cases, the true challenge is to unveil the mechanisms through which specific dynamical features are modulated by the underlying topology of the network. Here, we consider agents randomly hopping along the links of a graph, with the additional possibility of performing long-range hops to randomly chosen disconnected nodes with a given probability. We show that an optimal combination of the two jump rules exists that maximises the efficiency of target search, the optimum reflecting the topology of the network.

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

↑