无标度网络的最大-最小度搜索算法

许多实际的复杂网络具有无标度的特性,其中高连接度的节点具有重要作用.研究无标度网络的搜索算法.基于最大度的节点的搜索算法只适用于幂律度分布的指数介于2.0和2.3之间的无标度网络.对该算法做出了改进,提出了可适用于较大幂律指数的无标度网络的局部搜索的最大-最小度搜索算法.最大-最小度算法和人们熟知的随机游走、最大度搜索策略相比,更加充分利用了网络节点度分布特性,从而获得了更优的搜索效果,文章从理论分析和仿真结果两方面证实了这一点.

A Max -Min Degree Search Algorithm in Scale -Free Networks

Many real complex networks have the scale - free feature, in which high degree nodes play an important role. This paper investigates search algorithm in scale - free networks. High - degree - based search algorithm works well only when the power - law exponent is between 2.0 and 2.3. The paper improves this algorithm and presents a max - min degree local search strategy which works well for scale - free networks with larger power - law exponents. Compared with such well - known strategies as random walk and high - degree seeking, the max - min degree search makes further use of degree distributions of scale - free networks. Theoretical analysis and relative simulation results in this paper are given to prove its feasibility.