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.
How to make nodes' removal from a graph as a function of time?
1 Ansicht (letzte 30 Tage)
Ältere Kommentare anzeigen
Waseem AL Aqqad
am 14 Jan. 2021
Kommentiert: Waseem AL Aqqad
am 5 Feb. 2021
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.
Akzeptierte Antwort
Christine Tobler
am 15 Jan. 2021
You may want to look at the graph and digraph classes: Graph and Network Algorithms and their method rmnode specifically.
6 Kommentare
Weitere Antworten (0)
Siehe auch
Kategorien
Mehr zu Graph and Network Algorithms finden Sie in Help Center und File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!