稀疏图上的最短路竞争
The Competition for Shortest Paths on Sparse Graphs
摘要：
在存在非线性重叠代价的情况下，分析研究了连接随机选择的网络节点和固定路由器的最优路径。路由变得越来越困难，因为选择的节点的数量增加，并表现出遍历性的情况下，多个路由器打破。设计了一种分布式线性可扩展路由算法。这种系统的基态揭示了非单调复杂的行为，在平均路径长度和算法收敛，取决于网络拓扑结构，和通信节点和路由器的密度。
英文摘要：
Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion. Routing becomes increasingly more difficult as the number of selected nodes increases and exhibits ergodicity breaking in the case of multiple routers. A distributed linearly-scalable routing algorithm is devised. The ground state of such systems reveals non-monotonic complex behaviors in both average path-length and algorithmic convergence, depending on the network topology, and densities of communicating nodes and routers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
