Exact controllability of complex networks

Version 1.0.0.0 (1.22 MB) by Tapan
Implements maximum multiplicity algorithm to identify a set of driver nodes
0.0
(0)
742 Downloads
Updated 28 Jan 2015

View License

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.

Cite As

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

MATLAB Release Compatibility
Created with R2013b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags
Acknowledgements

Inspired by: Scale free network using B-A algorithm

controllability-2/

Version Published Release Notes
1.0.0.0