Please wait a minute...
Chin. Phys. B, 2009, Vol. 18(9): 3783-3789    DOI: 10.1088/1674-1056/18/9/028
GENERAL Prev   Next  

A self-organizing shortest path finding strategy on complex networks

Shen Yi(沈毅)†ger, Pei Wen-Jiang(裴文江), Wang Kai(王开), and Wang Shao-Ping(王少平)
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  
Received:  10 December 2008      Revised:  14 January 2009      Accepted manuscript online: 
PACS:  05.65.+b (Self-organized systems)  
  89.75.Fb (Structures and organization in complex systems)  
  89.75.Hc (Networks and genealogical trees)  
Fund: Project supported by the National Natural Science Foundation of China (Grant No 60672095), the National High-Tech Research and Development Program of China (Grant No 2007AA11Z210), the Doctoral Fund of Ministry of Education of China (Grant No 20070286004), the Natural Science Foundation of Jiangsu Province, China (Grant No BK2008281), the Science and Technology Program of Southeast University, China (Grant No KJ2009351), and the Excellent Young Teachers Program of Southeast University, China (Grant No BG2007428).

Cite this article: 

Shen Yi(沈毅), Pei Wen-Jiang(裴文江), Wang Kai(王开), and Wang Shao-Ping(王少平) A self-organizing shortest path finding strategy on complex networks 2009 Chin. Phys. B 18 3783

[1] Analysis of cut vertex in the control of complex networks
Jie Zhou(周洁), Cheng Yuan(袁诚), Zu-Yu Qian(钱祖燏), Bing-Hong Wang(汪秉宏), and Sen Nie(聂森). Chin. Phys. B, 2023, 32(2): 028902.
[2] Vertex centrality of complex networks based on joint nonnegative matrix factorization and graph embedding
Pengli Lu(卢鹏丽) and Wei Chen(陈玮). Chin. Phys. B, 2023, 32(1): 018903.
[3] Inertial focusing and rotating characteristics of elliptical and rectangular particle pairs in channel flow
Pei-Feng Lin(林培锋), Xiao Hu(胡箫), and Jian-Zhong Lin(林建忠). Chin. Phys. B, 2022, 31(8): 080501.
[4] Characteristics of vapor based on complex networks in China
Ai-Xia Feng(冯爱霞), Qi-Guang Wang(王启光), Shi-Xuan Zhang(张世轩), Takeshi Enomoto(榎本刚), Zhi-Qiang Gong(龚志强), Ying-Ying Hu(胡莹莹), and Guo-Lin Feng(封国林). Chin. Phys. B, 2022, 31(4): 049201.
[5] Robust H state estimation for a class of complex networks with dynamic event-triggered scheme against hybrid attacks
Yahan Deng(邓雅瀚), Zhongkai Mo(莫中凯), and Hongqian Lu(陆宏谦). Chin. Phys. B, 2022, 31(2): 020503.
[6] Finite-time synchronization of uncertain fractional-order multi-weighted complex networks with external disturbances via adaptive quantized control
Hongwei Zhang(张红伟), Ran Cheng(程然), and Dawei Ding(丁大为). Chin. Phys. B, 2022, 31(10): 100504.
[7] LCH: A local clustering H-index centrality measure for identifying and ranking influential nodes in complex networks
Gui-Qiong Xu(徐桂琼), Lei Meng(孟蕾), Deng-Qin Tu(涂登琴), and Ping-Le Yang(杨平乐). Chin. Phys. B, 2021, 30(8): 088901.
[8] Complex network perspective on modelling chaotic systems via machine learning
Tong-Feng Weng(翁同峰), Xin-Xin Cao(曹欣欣), and Hui-Jie Yang(杨会杰). Chin. Phys. B, 2021, 30(6): 060506.
[9] Exploring individuals' effective preventive measures against epidemics through reinforcement learning
Ya-Peng Cui(崔亚鹏), Shun-Jiang Ni (倪顺江), and Shi-Fei Shen(申世飞). Chin. Phys. B, 2021, 30(4): 048901.
[10] Influential nodes identification in complex networks based on global and local information
Yuan-Zhi Yang(杨远志), Min Hu(胡敏), Tai-Yu Huang(黄泰愚). Chin. Phys. B, 2020, 29(8): 088903.
[11] Identifying influential spreaders in complex networks based on entropy weight method and gravity law
Xiao-Li Yan(闫小丽), Ya-Peng Cui(崔亚鹏), Shun-Jiang Ni(倪顺江). Chin. Phys. B, 2020, 29(4): 048902.
[12] Modeling and analysis of the ocean dynamic with Gaussian complex network
Xin Sun(孙鑫), Yongbo Yu(于勇波), Yuting Yang(杨玉婷), Junyu Dong(董军宇)†, Christian B\"ohm, and Xueen Chen(陈学恩). Chin. Phys. B, 2020, 29(10): 108901.
[13] Pyramid scheme model for consumption rebate frauds
Yong Shi(石勇), Bo Li(李博), Wen Long(龙文). Chin. Phys. B, 2019, 28(7): 078901.
[14] Theoretical analyses of stock correlations affected by subprime crisis and total assets: Network properties and corresponding physical mechanisms
Shi-Zhao Zhu(朱世钊), Yu-Qing Wang(王玉青), Bing-Hong Wang(汪秉宏). Chin. Phys. B, 2019, 28(10): 108901.
[15] Coordinated chaos control of urban expressway based on synchronization of complex networks
Ming-bao Pang(庞明宝), Yu-man Huang(黄玉满). Chin. Phys. B, 2018, 27(11): 118902.
No Suggested Reading articles found!