D-summable fractal dimensions of complex networks. (February 2019)

• Record Type: Journal Article
• Authors: Ramirez-Arellano, Aldo; Bermúdez-Gómez, Salvador; Hernández-Simón, Luis Manuel; Bory-Reyes, Juan
• Is Part Of: Chaos, solitons and fractals. Volume 119(2019)
• Page Start: 210
• Page End: 214
• Publication Date: 2019-02
• Subjects: Fractals -- Information dimensions -- D-summability -- Complex networks -- Box-counting algorithm; Chaotic behavior in systems -- Periodicals; Solitons -- Periodicals; Fractals -- Periodicals; Chaotic behavior in systems; Fractals; Solitons; Periodicals; 003.7
• DOI: 10.1016/j.chaos.2018.12.026
• Languages: English
• ISSNs: 0960-0779

Abstract

Highlights: The concept of d-summable sets is applied in complex networks to measure fractal dimension. The concept of d-summable sets has not yet been applied in complex networks. The d-summable information model fits the covering of the network best for several examples. Empirical evidence suggest that information dimension is not a universal model of real complex networks. Abstract: In past two decades a wide range of complex systems, spanning many different disciplines, have been structured in the form of networks. Network dimension is a crucial concept to understand not only network topology, but also dynamical processes on networks. From the perspective of the box covering, volume dimension, information dimension, and correlation dimension several approaches have been proposed. We modify the commonly used definitions of the box dimension and information dimension to introduce a d-summable approach (a geometric notion that comes from geometric measure theory) of these dimensions. It is applied to calculate d-summable information dimension of several real complex networks. We offer empirical evidence to support the conjecture that d-summable information model worth carrying out than information model for several networks.