arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.04507physics.soc-phphysics.data-an
收藏

在软随机几何图中最短路径节点的几何组织与推断

Geometric Organization and Inference of Shortest Path Nodes in Soft Random Geometric Graphs

Delft University of Technology(代尔夫特理工大学);HUN-REN Alfréd Rényi Institute of Mathematics(匈牙利科学院阿尔弗雷德·雷尼数学研究所)

Zhihao Qiu, Sámuel G. Balogh, Xinhan Liu, Piet Van Mieghem, Maksim Kitsak

AI总结:

研究在软随机几何图中通过几何方法识别最短路径节点,发现其对齐强度与网络规模和连接范围相关,优于传统网络算法。

摘要:

最短路径问题与许多网络上的动态过程相关,从通信网络中的路由到分子相互作用网络中的信号传递。当网络完全已知时,最短路径问题可以精确求解并在多项式时间内完成。然而,如果感兴趣的网络只是部分可观察的,最短路径问题就不再简单。受部分可观察网络中最短路径问题的启发,我们研究了欧几里得软随机几何图(SRGGs)中最短路径的几何特性。我们发现最短路径沿着连接最短路径端点的测地线对齐。最短路径对齐的强度,以最短路径节点到测地线的平均距离和平均路径伸展度来量化,对于具有短程连接的较大SRGGs来说更高。此外,我们发现最短路径对齐的强度与SRGG的平均度数是非单调的。基于这些观察,我们建立了在何种条件下最短路径的对齐足以允许基于节点接近测地线来识别最短路径节点的条件。我们证明在具有不确定节点位置的部分可观察网络中,我们的几何方法可以优于基于网络的最短路径算法。在实际应用中,我们的发现可能应用于导航、无线路由和基础设施网络中的流量表征。

英文摘要:

The shortest path problem is related to many dynamic processes on networks, ranging from routing in communication networks to signaling in molecular interaction networks. When the network is fully known, the shortest path problem can be solved precisely and in polynomial time. If, however, the network of interest is only partially observable, the shortest path problem is no longer straightforward. Inspired by the shortest path problem in partially observable networks, we investigate the geometric properties of shortest paths in {\it Euclidean} Soft Random Geometric Graphs (SRGGs). We find that shortest paths are aligned along geodesic curves connecting shortest path endpoints. The strength of the shortest path alignment, as quantified by the average distance to geodesic from shortest path nodes and the average path stretch, is higher for larger SRGGs with short-range connections. In addition, we find that the strength of the shortest path alignment is non-monotonic with respect to the average degree of the SRGG. Based on these observations, we establish the conditions under which the alignment of shortest paths may be sufficiently strong to allow the identification of shortest path nodes based on their proximity to geodesic curves. We show that in partially observable networks with uncertain node positions, our geometric approach can outperform network-based shortest-path algorithms. In practical settings, our findings may have applications to navigation, wireless routing, and flow characterization in infrastructure networks.

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

↑