Overlapping-box-covering method for the fractal dimension of complex networks

Coarse-graining network flow through statistical physics and machine learning

Information dynamics plays a crucial role in complex systems, from cells to societies. Recent advances in statistical physics have made it possible to capture key network properties, such as flow diversity and signal speed, using entropy and free energy. However, large system sizes pose computational challenges. We use graph neural networks to identify suitable groups of components for coarse-graining a network and achieve a low computational complexity, suitable for practical application. Our approach preserves information flow even under significant compression, as shown through theoretical analysis and experiments on synthetic and empirical networks. We find that the model merges nodes with similar structural properties, suggesting they perform redundant roles in information transmission. This method enables low-complexity compression for extremely large networks, offering a multiscale perspective that preserves information flow in biological, social, and technological networks better than existing methods mostly focused on network structure.

Complexity and phase transitions in citation networks: insights from artificial intelligence research

In this study, we analyze the changes over time in the complexity and structure of words used in article titles and the connections between articles in citation networks, focusing on the topic of artificial intelligence (AI) up to 2020. By measuring unpredictability in word usage and changes in the connections between articles, we gain insights into shifts in research focus and diversity of themes. Our investigation reveals correspondence between fluctuations in word complexity and changes in the structure of citation networks, highlighting links between thematic evolution and network dynamics. This approach not only enhances our understanding of scientific progress but also may help in anticipating emerging fields and fostering innovation, providing a quantitative lens for studying scientific domains beyond AI.

Epidemic propagation risk study with effective fractal dimension

In this article, the risk of epidemic transmission on complex networks is studied from the perspective of effective fractal dimension. First, we introduce the method of calculating the effective fractal dimensionD B ${D}_B$ of the network by taking a scale-free network as an example. Second, we propose the construction method of administrative fractal network and calculate theD B ${D}_B$ . using the classical susceptible exposed infectious removed (SEIR) infectious disease model, we simulate the virus propagation process on the administrative fractal network. The results show that the larger theD B ${D}_B$ is, the higher the risk of virus transmission is. Later, we proposed five parameters P, M, B, F, and D, where P denotes population mobility, M denotes geographical distance, B denotes GDP, F denotesD B ${D}_B$ , and D denotes population density. The new epidemic growth index formulaI = ( P + ( 1 - M ) + B ) ( F + D ) $I = {( {P + ( {1 - M} ) + B} )}^{( {F + D} )}$ was obtained by combining these five parameters, and the validity of I in epidemic transmission risk assessment was demonstrated by parameter sensitivity analysis and reliability analysis. Finally, we also confirmed the reliability of the SEIR dynamic transmission model in simulating early COVID-19 transmission trends and the ability of timely quarantine measures to effectively control the spread of the epidemic.

Correlation dimension in empirical networks

Network correlation dimension governs the distribution of network distance in terms of a power-law model and profoundly impacts both structural properties and dynamical processes. We develop new maximum likelihood methods which allow us robustly and objectively to identify network correlation dimension and a bounded interval of distances over which the model faithfully represents structure. We also compare the traditional practice of estimating correlation dimension by modeling as a power law the fraction of nodes within a distance to a proposed alternative of modeling as a power law the fraction of nodes at a distance. In addition, we illustrate a likelihood ratio technique for comparing the correlation dimension and small-world descriptions of network structure. Improvements from our innovations are demonstrated on a diverse selection of synthetic and empirical networks. We show that the network correlation dimension model accurately captures empirical network structure over neighborhoods of substantial size and span and outperforms the alternative small-world network scaling model. Our improved methods tend to lead to higher estimates of network correlation dimension, implying that prior studies could have produced or utilized systematic underestimates of dimension.

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

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²), which is reasonable and acceptable.

Robustness of scale-free networks to cascading failures induced by fluctuating loads

Taking into account the fact that overload failures in real-world functional networks are usually caused by extreme values of temporally fluctuating loads that exceed the allowable range, we study the robustness of scale-free networks against cascading overload failures induced by fluctuating loads. In our model, loads are described by random walkers moving on a network and a node fails when the number of walkers on the node is beyond the node capacity. Our results obtained by using the generating function method show that scale-free networks are more robust against cascading overload failures than Erdős-Rényi random graphs with homogeneous degree distributions. This conclusion is contrary to that predicted by previous works, which neglect the effect of fluctuations of loads.

Metabolic networks are almost nonfractal: a comprehensive evaluation

Network self-similarity or fractality are widely accepted as an important topological property of metabolic networks; however, recent studies cast doubt on the reality of self-similarity in the networks. Therefore, we perform a comprehensive evaluation of metabolic network fractality using a box-covering method with an earlier version and the latest version of metabolic networks and demonstrate that the latest metabolic networks are almost self-dissimilar, while the earlier ones are fractal, as reported in a number of previous studies. This result may be because the networks were randomized because of an increase in network density due to database updates, suggesting that the previously observed network fractality was due to a lack of available data on metabolic reactions. This finding may not entirely discount the importance of self-similarity of metabolic networks. Rather, it highlights the need for a more suitable definition of network fractality and a more careful examination of self-similarity of metabolic networks.