Author
Listed:
- Guo, Zhengao
- Zhou, Yinzuo
- Zhou, Jie
Abstract
Directed hypergraphs (DH) provide a powerful framework for characterizing directional influences and higher-order interactions in complex systems. In many real-world systems, the group interactions represented by directed hyperedges generally have an inherent requirement of integrity, meaning their functionality depends on the simultaneous presence of all participating nodes. Traditional definition of strongly connected components that was proposed for classic directed graphs do not explicitly capture this requirement, which may lead to biased evaluation in the robustness of the system. To address this issue, we introduce the concept of the Completely Connected Component (CCC) of DH as a pertinent representation for such connectivity. By requiring that every directed hyperedge should satisfy the integrity condition, the CCC ensures the preservation of nodes incident to related hyperedges. In this paper we study the robustness of interdependent DH from the perspective of CCC, which has wide applications in many real-world systems. Based on a bipartite representation of DH, we develop a theoretical framework for analyzing the system. We systematically evaluate the system’s robustness under different types of interdependencies induced from CCC. Our analysis shows that the requirement of the integrity of hyperedges will markedly influence the robustness of the system, which is verified with numerical simulations. Specifically, since the CCC condition reinforces the preservation of nodes, interdependence between hypergraphs that takes place on nodes typically exhibit stronger robustness than that involving hyperedges. However, the system could be more vulnerable when the initial damage targets nodes rather than hyperedges. By analyzing the competing effects induced by the CCC on both the initial damage and the objects involved in the interdependence, non-monotonic behaviors of the system robustness are revealed. Our finding offers a deeper understanding of the robustness of systems with high-order interactions across various interdependence scenarios.
Suggested Citation
Guo, Zhengao & Zhou, Yinzuo & Zhou, Jie, 2026.
"Robustness of interdependent directed hypergraphs with completely connected component,"
Chaos, Solitons & Fractals, Elsevier, vol. 208(P1).
Handle:
RePEc:eee:chsofr:v:208:y:2026:i:p1:s0960077926002328
DOI: 10.1016/j.chaos.2026.118091
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:208:y:2026:i:p1:s0960077926002328. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.