显式和隐式网络连通性:解析公式及其在输运过程中的应用
Explicit and implicit network connectivity: Analytical formulation and application to transport processes
摘要:
连通性是网络的一个基本结构特征,它决定了网络上发生的任何动态的结果。然而,仍然缺少一种分析方法来获得与不同长度路径相关联的节点之间的连接概率。在这里,我们推导出一个通用的时间,有向和加权网络中的任何范围内的步骤数的随机行走连接概率的精确表达式。这允许表征由因果路径实现的显式连接以及与三个节点和两个链接的图案相关的隐式连接,这里称为干草叉。我们直接将这种概率与标记和采样网络中交换的任何数量的过程联系起来,从而提供了一个自然的框架来评估运输动态。最后,我们应用我们的理论框架,研究海洋运输功能在地中海。我们发现,相关的运输结构,如流体屏障和走廊,可以产生对比和反直觉的连接模式,使新的见解如何洋流驱动海景连接。
英文摘要:
Connectivity is a fundamental structural feature of a network that determines the outcome of any dynamics that happens on top of it. However, an analytical approach to obtain connection probabilities between nodes associated to paths of different lengths is still missing. Here, we derive exact expressions for random-walk connectivity probabilities across any range of numbers of steps in a generic temporal, directed and weighted network. This allows characterizing explicit connectivity realized by causal paths as well as implicit connectivity related to motifs of three nodes and two links called here pitchforks. We directly link such probabilities to the processes of tagging and sampling any quantity exchanged across the network, hence providing a natural framework to assess transport dynamics. Finally, we apply our theoretical framework to study ocean transport features in the Mediterranean Sea. We find that relevant transport structures, such as fluid barriers and corridors, can generate contrasting and counter-intuitive connectivity patterns bringing novel insights into how ocean currents drive seascape connectivity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。