Exact controllability of complex networks
Implements maximum multiplicity algorithm to identify a set of driver nodes
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
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://au.mathworks.com/matlabcentral/fileexchange/49357-exact-controllability-of-complex-networks), MATLAB Central File Exchange. Retrieved .
Acknowledgements
Inspired by: Scale free network using B-A algorithm
General Information
- Version 1.0.0.0 (1.22 MB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 |
