Stability of directed Min-Max optimal paths

被引:1
|
作者
Perlsman, E. [1 ]
Havlin, S. [1 ]
机构
[1] Bar Ilan Univ, Dept Phys, IL-52900 Ramat Gan, Israel
关键词
D O I
10.1209/0295-5075/77/20003
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The stability of directed Min-Max optimal paths in cases of change in the random media is studied. Using analytical arguments it is shown that when small perturbations (epsilon) are applied to the weights of the bonds of the lattice, the probability that the new Min-Max optimal path is different from the original Min-Max optimal path is proportional to t(1/nu)parallel to epsilon, where t is the size of the lattice, and nu(parallel to) is the longitudinal correlation exponent of the directed percolation model. It is also shown that in a lattice whose bonds are assigned with weights which are near the strong disorder limit, the probability that the directed polymer optimal path is different from the optimal Min-Max path is proportional to t(2/nu)parallel to/k(2), where k is the strength of the disorder. These results are supported by numerical simulations. Copyright (C) EPLA, 2007.
引用
收藏
页数:4
相关论文
共 50 条
  • [21] Robust stability analysis for autonomous min-max systems
    Zhao, Qianchuan
    Zheng, Da-Zhong
    EUROPEAN JOURNAL OF CONTROL, 2008, 14 (02) : 104 - 113
  • [22] MIN-MAX INDICATOR
    VASILEV, SI
    SIDELNIKOV, ZI
    INSTRUMENTS AND EXPERIMENTAL TECHNIQUES, 1983, 26 (06) : 1325 - 1327
  • [23] On a min-max theorem
    Wu G.R.
    Huang W.H.
    Shen Z.H.
    Applied Mathematics-A Journal of Chinese Universities, 1997, 12 (3) : 293 - 298
  • [24] Min-max and min-max regret versions of combinatorial optimization problems: A survey
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (02) : 427 - 438
  • [25] THE COMPLEXITY OF FINDING 2 DISJOINT PATHS WITH MIN-MAX OBJECTIVE FUNCTION
    LI, CL
    MCCORMICK, ST
    SIMCHILEVI, D
    DISCRETE APPLIED MATHEMATICS, 1990, 26 (01) : 105 - 115
  • [26] Pseudo-polynomial algorithms for min-max and min-max regret problems
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    Operations Research and Its Applications, 2005, 5 : 171 - 178
  • [27] Min-max and min-max (relative) regret approaches to representatives selection problem
    Dolgui, Alexandre
    Kovalev, Sergey
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2012, 10 (02): : 181 - 192
  • [28] Min-max optimal data encoding and fusion in sensor networks
    Zherlitsyn, Gleb
    Matveev, Alexey S.
    AUTOMATICA, 2010, 46 (09) : 1546 - 1552
  • [29] Medial axis and optimal locations for min-max sphere packing
    Wang, J
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2000, 4 (04) : 487 - 503
  • [30] OPTIMAL DEFENSIVE MISSILE ALLOCATION - DISCRETE MIN-MAX PROBLEM
    SOLAND, RM
    OPERATIONS RESEARCH, 1973, 21 (02) : 590 - 596