Determining the robustness of an interdependent network with a hypergraph model
<p class="p1">The world is included of various entities and complex interdependencies between them that can be appeared in multi-layered networks. It may be the acting of some of these entities depends on the acting of the others such that the failure in one entity may cause failures...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2020-04-01
|
| Series: | Electronic Journal of Graph Theory and Applications |
| Subjects: | |
| Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/342 |
| Summary: | <p class="p1">The world is included of various entities and complex interdependencies between them that can be appeared in multi-layered networks. It may be the acting of some of these entities depends on the acting of the others such that the failure in one entity may cause failures in a number of others. In this paper we try to model these complex interdependencies in a interdependent network with a directed hypergraph model and then we propose an algorithm to determine minimum number of failure for total failure in the power grid and communication network as a special interdependent network.<span class="Apple-converted-space"> </span></p> |
|---|---|
| ISSN: | 2338-2287 |