Abstract: Aiming at the problem that the acceleration strategy of the traditional random walking algorithm had some limitations when dealing with large-scale power grids, we proposed a random walking acceleration algorithm based on variable step size. Firstly, based on the experimental comparison of different number of nodes and threshold size, the time efficiency of traditional random walking acceleration algorithm and variable step size random walking acceleration algorithm was analyzed, then it was proved that the variable step size random walking acceleration algorithm could greatly improve the efficiency of power grids analysis. Secondly, we proved that the random walking algorithm had spatial local characteristics, which could further release the running space. Experiments on power grids of different scales show that the method can optimize the running space of the algorithm.

Key words: random walking algorithm, power grids, variable step size, dynamic analysis, space optimization