MATLAB Answers

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

337 views (last 30 days)
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 Comment
Waseem AL Aqqad
Waseem AL Aqqad on 14 Jan 2021
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.

Sign in to comment.

Accepted Answer

Christine Tobler
Christine Tobler on 15 Jan 2021
You may want to look at the graph and digraph classes: Graph and Network Algorithms and their method rmnode specifically.
Waseem AL Aqqad
Waseem AL Aqqad on 5 Feb 2021
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.

Sign in to comment.

More Answers (0)

Community Treasure Hunt

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

Start Hunting!