A self-organizing shortest path finding strategy on complex networks |
| |
Authors: | Shen Yi Pei Wen-Jiang Wang Kai and Wang Shao-Ping |
| |
Institution: | School of Information Science and Engineering, Southeast
University,
Nanjing 210096, China |
| |
Abstract: | The shortcomings of traditional methods to find the shortest path
are revealed, and a strategy of finding the self-organizing shortest
path based on thermal flux diffusion on complex networks is
presented. In our method, the shortest paths between the source node
and the other nodes are found to be self-organized by comparing node
temperatures. The computation complexity of the method scales
linearly with the number of edges on underlying networks. The
effects of the method on several networks, including a regular
network proposed by Ravasz and Barabási which is called the RB
network, a real network, a random network proposed by Ravasz and
Barabási which is called the ER network and a scale-free network, are
also demonstrated. Analytic and simulation results show that the
method has a higher accuracy and lower computational complexity than
the conventional methods. |
| |
Keywords: | complex networks self-organization the shortest path thermal flux diffusion |
本文献已被 维普 等数据库收录! |
| 点击此处可从《中国物理 B》浏览原始摘要信息 |
| 点击此处可从《中国物理 B》下载免费的PDF全文 |
|