image thumbnail

Exact controllability of complex networks

version (1.22 MB) by Tapan
Implements maximum multiplicity algorithm to identify a set of driver nodes


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 (2022). 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

Inspired by: Scale free network using B-A algorithm

Community Treasure Hunt

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

Start Hunting!