Determining the robustness of an interdependent network with a hypergraph model
| Main Authors: | Shirdel, Gholam Hasan; Department of Mathematics, University of Qom, Qom, I. R. Iran, Mortezaee, Ameneh; Department of Mathematics, University of Qom, Qom, I. R. Iran |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2020
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/342 https://www.ejgta.org/index.php/ejgta/article/view/342/pdf_128 |
Daftar Isi:
- 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.