I found this image on wikipedia referring to Barabasi's work on Network Controllability. I tried to verify it. We have a A matrix of dimensions (20 by 20) made as the image suggests. According to the 'e' the B input matrix should be of dimensions (20 by 5) where 5 components will be non-zero, while the rest will be zero. I gave the non-zero components at first, the value 1, and then values between 0 and 1. I kept getting the network was uncontrollable.
I believe it is comprehension mistake of mine regarding how I interpreted the method. 1. I would appreciate if someone could indicate what didn't work 2. Is there a public version of Barabasi's code for maximum matching?