时间加权网络中的最可能路径：在海洋运输中的应用
Most probable paths in temporal weighted networks: An application to ocean transport
摘要：
我们考虑加权和定向时间网络中的路径，引入工具来计算高概率的路径集。我们量化的相对重要性，相对于整个路径集，两个节点之间的最可能的路径，并将大部分的连接概率的一个子集的高度可能的路径。这些概念用于提供介数中心性的替代定义。我们应用我们的形式主义的运输网络描述在地中海的表面流。尽管完整的传输动力学是由大量的路径来描述的，但我们发现，对于现实的时间尺度，只有一个非常小的高概率路径子集（甚至是一个最可能的路径）足以表征网络的全局连通性。
英文摘要：
We consider paths in weighted and directed temporal networks, introducing tools to compute sets of paths of high probability. We quantify the relative importance of the most probable path between two nodes with respect to the whole set of paths, and to a subset of highly probable paths which incorporate most of the connection probability. These concepts are used to provide alternative definitions of betweenness centrality. We apply our formalism to a transport network describing surface flow in the Mediterranean sea. Despite the full transport dynamics is described by a very large number of paths we find that, for realistic time scales, only a very small subset of high probability paths (or even a single most probable one) is enough to characterize global connectivity properties of the network.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
