Catastrophic fragmentation and structural transitions are ubiquitous in real-world complex systems, yet their underlying universality classes remain largely elusive due to strong structural heterogeneity and the absence of well-defined critical thresholds. Here, we discover a robust phenomenon of temporal self-similarity governing the dynamic percolation process across diverse complex networks. By tracking the full statistics of incremental growth events, we reveal that fragmentation dynamics are governed by two independent Fisher-type critical exponents, τc and τs. These exponents uniquely characterize the system’s universality class, from which all other standard critical exponents can be derived through newly established scaling relations. After rigorously validating this framework on canonical network models, we apply it to extensive empirical datasets. Strikingly, our analyses across biological, social, and infrastructural systems demonstrate that real-world networks systematically exhibit universality classes distinct from those predicted by idealized network models, reflecting the influence of higher-order structural features. Our findings establish a dynamic paradigm that bridges statistical physics and real-world resilience, offering a parameter-free, highly scalable approach to classify and characterize structural vulnerabilities in inherently heterogeneous systems. Without prior knowledge of the critical point, classifying network collapse is a challenge. Here, authors uncover temporal self-similarity by tracking the ordered sequence of bond addition events, and demonstrate that this framework identifies percolation universality for both model and empirical networks, using only a single system size and requiring no exact threshold.
The proposed percolation process displays a universal phase transition, characterized by the abrupt and simultaneous disappearance of both the giant connected component and the largest 2-core, across networks with markedly different degree distributions, indicating that the physics of network dismantling is insensitive...
L. Cirigliano, Claudio Castellano, Minsuk Kim et al.· 0 citations
This paper empirically evaluates the DAG-ness framework, a four-component measure that quantifies acyclicity, flow alignment, cyclic locality, and pathway complexity across a corpus of 107 networks drawn from twelve structurally diverse domains, and finds that macroscopic acyclicity is pervasive even in feedback-rich s...
This work shows that a dual-threshold bootstrap percolation model on random hypergraphs separates a connected active backbone from large-scale endogenous activation, providing a basis for predicting cascade risk and designing targeted node- and group-level interventions in complex systems.
A diagnostic framework designed to isolate the explanatory contribution of local interaction rules to connectome organization through simulations that identify which structural properties emerge directly from locality and which require additional mechanisms beyond local constraints is provided.
We derive a one-dimensional reduction for nonlinear dynamics on simplicial complexes containing both pairwise and triangular (higher-order) interactions. The effective state is defined using a mixed weight determined by the pairwise and triangular degrees of each node. The resulting reduced equation retains two structu...
Amit Tiwari, C. Hens, Prosenjit Kundu· 0 citations
The results show that smaller clusters are generally more vulnerable to attacks on central nodes, whereas larger and less centralized clusters retain more topological efficiency.
Si-Lu Wang, Q. Hu, Jiao Gu· Entropy· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.