Universal vulnerability in strong modular networks with various degree distributions between inequality and equality
arXiv:2508.20317 · doi:10.1038/s41598-025-17794-5
Abstract
Generally, networks are classified into two sides of inequality and equality with respect to the number of links at nodes by the types of degree distributions. One side includes many social, technological, and biological networks which consist of a few nodes with many links, and many nodes with a few links, whereas the other side consists of all nodes with an equal number of links. In comprehensive investigations between them, we have found that, as a more equal network, the tolerance of whole connectivity is stronger without fragmentation against the malfunction of nodes in a wide class of randomized networks. However, we newly find that all networks which include typical well-known network structures between them become extremely vulnerable, if a strong modular (or community) structure is added with commonalities of areas, interests, religions, purpose, and so on. These results will encourage avoiding too dense unions by connecting nodes and taking into account the balanced resource allocation between intra- and inter-links of weak communities. We must reconsider not only efficiency but also tolerance against attacks or disasters, unless no community that is really impossible.
43 pages, 5 figures (+20 figures in Supplement), 1 table(+2 tables in Supplement)
References in corpus (24)
- Emergence of scaling in random networks
- Modularity and community structure in networks
- Community detection in graphs
- Error and attack tolerance of complex networks
- Classes of behavior of small-world networks
- The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
- Influence maximization in complex networks through optimal percolation
- Mitigation of Malicious Attacks on Networks
- The complex network of global cargo ship movements
- Organization of Growing Random Networks
- Generation of uncorrelated random scale-free networks
- Robustness and resilience of complex networks
- Network dismantling
- Identifying optimal targets of network attack by belief propagation
- Small-worlds: How and why
- Robustness of onion-like correlated networks against targeted attacks
- Onion structure and network robustness
- Complex networks vulnerability to module-based attacks
- A new design principle of robust onion-like networks self-organized in growth
- Emergence of Robust and Efficient Networks in a Family of Attachment Models
- Growing Self-organized Design of Efficient and Robust Complex Networks
- Cycle density in infinite Ramanujan graphs
- Spatially self-organized resilient networks by a distributed cooperative mechanism
- Vulnerable Connectivity Caused by Local Communities in Spatial Networks