The effect of weight heterogeneity on the shortest path of weighted Cayley network

被引:0
|
作者
Han, Yuxi [1 ]
Wu, Bo [2 ]
机构
[1] Changzhou Wujin Second Sr High Sch, Changzhou 213149, Peoples R China
[2] Nanjing Univ Finance & Econ, Sch Appl Math, Nanjing 210023, Peoples R China
来源
关键词
Weighted Cayley networks; heterogeneity; average shortest path; AVERAGE RECEIVING TIME;
D O I
10.1142/S012918312450219X
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, we introduce the weighted Cayley network parameterized by three weight parameters r,q,g. The average weighted shortest path (AWSP) is calculated and its expression is derived. The results show that the AWSP of the network forms 10 laws with the range of weights r, q and g, and two laws based on single weight factor are generalized. From these 10 laws, we can see more clearly: When the average value of the weight factors (0<r,q,g<1) of the three branches is fixed, the larger the variance is, the larger the value of AWSP is; When the weight factor of any of the three branches is equal to 12, its AWSP value growth law is the same as that of the weight factor of 0 to 1, there is no special change; When any weight factor of the three branches is equal to 1, the network mainly grows with the logarithm of the network size. Meanwhile, the growth of the network has no boundary, but AWSP maintains a bounded state, and the growth rate of AWSP will be faster when the number of branch weights equal to 1 is more.
引用
收藏
页数:15
相关论文
共 50 条
  • [21] Research on the shortest path algorithm in grey weighted graph
    Xiao, XP
    Deng, LC
    FIFTH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND MANAGMENT SCIENCE: PROCEEDINGS OF IE & MS '98, 1998, : 409 - 412
  • [22] An Amoeboid Algorithm for Shortest Path in Fuzzy Weighted Networks
    Zhang, Yajuan
    Zhang, Zili
    Zhang, Xiaoge
    Wei, Daijun
    Deng, Yong
    PROCEEDINGS OF THE 2012 24TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2012, : 3709 - 3713
  • [23] An efficient approximation for weighted region shortest path problem
    Reif, J
    Sun, Z
    ALGORITHMIC AND COMPUTATIONAL ROBOTICS: NEW DIRECTIONS, 2001, : 191 - 203
  • [24] An Experimental Study of Weighted -Link Shortest Path Algorithms
    Daescu, Ovidiu
    Mitchell, Joseph S. B.
    Ntafos, Simeon
    Palmer, James D.
    Yap, Chee K.
    ALGORITHMIC FOUNDATION OF ROBOTICS VII, 2008, 47 : 187 - +
  • [25] Influence of the link weight structure on the shortest path
    Van Mieghem, P
    van Langen, S
    PHYSICAL REVIEW E, 2005, 71 (05):
  • [26] Shortest Path Analysis on Geospatial Data Using PgRouting Visualization of Shortest Path on Road Network
    Chadha, Chetan
    Garg, Shivang
    INTERNATIONAL CONFERENCE ON INNOVATIVE COMPUTING AND COMMUNICATIONS, VOL 1, 2019, 55 : 201 - 214
  • [27] Shortest-path algorithm using adjustable weight pulse-coupled neural network
    Du, Hua
    Zhou, Dongming
    Zhao, Dongfeng
    Bai, Yunhong
    Lin, Lin
    Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument, 2007, 28 (SUPPL. 5): : 269 - 273
  • [28] Heterogeneity-aware shortest path routing: Flow holding time, user demand and network state
    Yang, SC
    Su, X
    de Veciana, G
    2001 IEEE WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING, 2001, : 287 - 291
  • [29] Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
    Lyudmil Aleksandrov
    Hristo N. Djidjev
    Hua Guo
    Anil Maheshwari
    Doron Nussbaum
    Jörg-Rüdiger Sack
    Discrete & Computational Geometry, 2010, 44 : 762 - 801
  • [30] An Incremental Map Matching Algorithm Based on Weighted Shortest Path
    Chen, Jixiao
    Yang, Yongjian
    Huang, Liping
    Zhu, Zhuo
    Yang, Funing
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2018, PT I, 2018, 11334 : 323 - 336