How to make nodes' removal from a graph as a function of time?

4 ビュー (過去 30 日間)
Waseem AL Aqqad
Waseem AL Aqqad 2021 年 1 月 14 日
コメント済み: Waseem AL Aqqad 2021 年 2 月 5 日
Hello,
I'm simulating failures of nodes in an interdependent system (two graphs, g and h) and their adjacency matrices are A and B. Some nodes in graph g (layer A) will get attacked randomly, and then this failure will get propagated to graph h (layer B) through the interlinks between the two graphs.
I'm trying to simulate failure or nodes removal based on time, that is,
at: t=1, remove first node in A.
t=2, remove the second node in A
t=3, failure propagates to B and first node in B get removed and so on.
Your help would be highly appreciated.
  1 件のコメント
Waseem AL Aqqad
Waseem AL Aqqad 2021 年 1 月 14 日
It would be fine If you can show me how this works for a single layer. I can then apply it to multi-layers or graphs.

サインインしてコメントする。

採用された回答

Christine Tobler
Christine Tobler 2021 年 1 月 15 日
You may want to look at the graph and digraph classes: Graph and Network Algorithms and their method rmnode specifically.
  6 件のコメント
Waseem AL Aqqad
Waseem AL Aqqad 2021 年 2 月 5 日
Hi Christine, I don’t mean to bother you but I was wondering if you have had a chance to look at my problem yet? Your help is greatly appreciated.

サインインしてコメントする。

その他の回答 (0 件)

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by