A box-covering algorithm for fractal scaling in scale-free networks

Abstract

A random sequential box-covering algorithm recently introduced to measure the fractal dimension in scale-free networks is investigated. The algorithm contains Monte Carlo sequential steps of choosing the position of the center of each box, and thereby, vertices in preassigned boxes can divide subsequent boxes into more than one pieces, but divided boxes are counted once. We find that such box-split allowance in the algorithm is a crucial ingredient necessary to obtain the fractal scaling for fractal networks; however, it is inessential for regular lattice and conventional fractal objects embedded in the Euclidean space. Next the algorithm is viewed from the cluster-growing perspective that boxes are allowed to overlap and thereby, vertices can belong to more than one box. Then, the number of distinct boxes a vertex belongs to is distributed in a heterogeneous manner for SF fractal networks, while it is of Poisson-type for the conventional fractal objects.

12 pages, 11 figures, a proceedings of the conference, "Optimization in complex networks." held in Los Alamos

References in corpus (8)

• Emergence of scaling in random networks
• The diameter of the world wide web
• The large-scale organization of metabolic networks
• Self-similarity of complex networks
• Sandpile on Scale-Free Networks
• Skeleton and fractal scaling in complex networks
• Statistical ensemble of scale-free random graphs
• Fractality in complex networks: critical and supercritical skeletons

Cited by in corpus (21)

• Self-similar scaling of density in complex real-world networks
• Horizontal visibility graphs transformed from fractional Brownian motions: Topological properties versus Hurst index
• Determination of multifractal dimensions of complex networks by means of the sandbox algorithm
• Complete trails of co-authorship network evolution
• Multifractality of complex networks
• Multifractal analysis of weighted networks by a modified sandbox algorithm
• Fractal scale-free networks resistant to disease spread
• Detecting the ultra low dimensionality of real networks
• Optimization in Networks
• Renormalization flows in complex networks
• Comparative Analysis of Box-Covering Algorithms for Fractal Networks
• Random Sequential Renormalization of Networks I: Application to Critical Trees
• A Fixed-Mass multifractal approach for unweighted complex networks
• Random Sequential Renormalization and Agglomerative Percolation in Networks: Application to Erd"os-R'enyi and Scale-free Graphs
• Dismantling Efficiency and Network Fractality
• Fractal dimension of star clusters
• Multifractality of complex networks is also due to geometry. The Geometric SandBox algorithm
• Eigenvalue Preferential Attachment Networks A Dandelion Structure
• Hub-collision avoidance and leaf-node options algorithm for fractal dimension and renormalization of complex networks
• Upper Bound of Relative Error of Random Ball Coverage for Calculating Fractal Network Dimension
• Modelling the Self-similarity in Complex Networks Based on Coulomb's Law