arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.00291physics.soc-phnlin.AO
收藏

用于复杂网络分形维数与重整化的Hub-collision avoidance和leaf-node options算法

Hub-collision avoidance and leaf-node options algorithm for fractal dimension and renormalization of complex networks

Feiyan Guo, Jiajun Zhou, Zhongyuan Ruan, Jian Zhang, Lin Qi

AI总结:

本研究提出HALO算法,通过双向遍历减少采样随机性并优先选择大盒,在九个真实网络上以更少的盒数获得更高性能,准确估计分形维数且不受hub紧密程度影响。

摘要:

盒覆盖方法在复杂网络的分形性质识别和重整化分析中起着基础性作用。本研究提出了hub-collision avoidance和leaf-node options(HALO)算法。在盒采样过程中,确定了正向采样规则(用于避免hub碰撞)和反向采样规则(用于优先选择叶节点),以进行双向网络遍历,从而减少采样的随机性。在盒选择过程中,通过不断移除小盒,优先选择较大的必要盒加入解中。实验将compact-box-burning(CBB)算法、maximum-excluded-mass-burning(MEMB)算法、overlapping-box-covering(OBCA)算法,以及结合小盒移除策略和采样密度为30的最大盒采样算法(SM30)与HALO进行了比较。在九个真实网络上的结果表明,HALO取得了最高的性能得分,并且获得的盒数分别比上述对比算法少11.40%、7.67%、2.18%和8.19%。算法的确定性得到了显著提高。通过覆盖四个标准网络估计出的分形维数更加准确。此外,与MEMB或OBCA不同,HALO不受hub紧密程度的影响,在不同网络中表现出稳定的性能。最后,HALO和对比算法的时间复杂度均为O(N^2),这是合理且可接受的。

英文摘要:

The box-covering method plays a fundamental role in the fractal property recognition and renormalization analysis of complex networks. This study proposes the hub-collision avoidance and leaf-node options (HALO) algorithm. In the box sampling process, a forward sampling rule (for avoiding hub collisions) and a reverse sampling rule (for preferentially selecting leaf nodes) are determined for bidirectional network traversal to reduce the randomness of sampling. In the box selection process, the larger necessary boxes are preferentially selected to join the solution by continuously removing small boxes. The compact-box-burning (CBB) algorithm, the maximum-excluded-mass-burning (MEMB) algorithm, the overlapping-box-covering (OBCA) algorithm, and the algorithm for combining small-box-removal strategy and maximum box sampling with a sampling density of 30 (SM30) are compared with HALO in experiments. Results on nine real networks show that HALO achieves the highest performance score and obtains 11.40%, 7.67%, 2.18%, and 8.19% fewer boxes than the compared algorithms, respectively. The algorithm determinism is significantly improved. The fractal dimensions estimated by covering four standard networks are more accurate. Moreover, different from MEMB or OBCA, HALO is not affected by the tightness of the hubs and exhibits a stable performance in different networks. Finally, the time complexities of HALO and the compared algorithms are all O(N^2), which is reasonable and acceptable.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑