Comparative analysis of box-covering algorithms for fractal networks

Applied Network Science

Péter Tamás Kovács¹  Marcell Nagy¹  Roland Molontay² 

[1] Department of Stochastics, Budapest University of Technology and Economics, Budapest, Hungary;Department of Stochastics, Budapest University of Technology and Economics, Budapest, Hungary;MTA-BME Stochastics Reseach Group, Budapest, Hungary;

关键词: Fractality;    Box-covering;    Box-counting;    Approximating algorithms;    Comparative study;    Open source;   

DOI  :  10.1007/s41109-021-00410-6

来源: Springer

【 摘 要 】

Research on fractal networks is a dynamically growing field of network science. A central issue is to analyze the fractality with the so-called box-covering method. As this problem is known to be NP-hard, a plethora of approximating algorithms have been proposed throughout the years. This study aims to establish a unified framework for comparing approximating box-covering algorithms by collecting, implementing, and evaluating these methods in various aspects including running time and approximation ability. This work might also serve as a reference for both researchers and practitioners, allowing fast selection from a rich collection of box-covering algorithms with a publicly available codebase.

【 授权许可】

CC BY