Abstract

A complex network presents many topological features which characterize its behavior and dynamics. This characterization is an essential aspect of complex networks analysis and can be performed using several measures, including the fractal dimension. Originally the fractal dimension measures the complexity of an object in a Euclidean space, and the most common methods in the literature to estimate that dimension are box-counting, mass-radius, and Bouligand-Minkowski. However, networks are not Euclidean objects, so that these methods require some adaptation to measure the fractal dimension in this context. The literature presents some adaptations for methods like box-counting and mass-radius. However, there is no known adaptation developed for the Bouligand-Minkowski method. In this way, we propose an adaptation of the Bouligand-Minkowski to measure complex networks’ fractal dimension. We compare our proposed method with others, and we also explore the application of the proposed method in a classification task of complex networks that confirmed its promising potential.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.