Exact controllability of complex networks

Version 1.0.0.0 (1,22 MB) von Tapan
Implements maximum multiplicity algorithm to identify a set of driver nodes
0.0
(0)
742 Downloads
Aktualisiert 28. Jan 2015

Lizenz anzeigen

Please see demo.m for examples on use.
The ExactControllability.m function implements a maximum geometric multiplicity algorithm to identify the number and set of driver nodes in complex network (see included references). Input is an adjacency matrix - directed or undirected.
Please refer to ExactControllability.m for instructions on how to cite.

Zitieren als

Tapan (2026). Exact controllability of complex networks (https://de.mathworks.com/matlabcentral/fileexchange/49357-exact-controllability-of-complex-networks), MATLAB Central File Exchange. Abgerufen.

Kompatibilität der MATLAB-Version
Erstellt mit R2013b
Kompatibel mit allen Versionen
Plattform-Kompatibilität
Windows macOS Linux
Tags Tags hinzufügen
Quellenangaben

Inspiriert von: Scale free network using B-A algorithm

In neuem Tab öffnen
Version Veröffentlicht Versionshinweise
1.0.0.0