Maximum entropy networks are more controllable than preferential attachment networks

• The controllability of maximum entropy (ME) and Barabási–Albert (BA) networks is investigated.
• ME networks are significantly more easily controlled than BA networks of the same degree distribution.
• The properties of the neighbors of driver node sensitively affect the network controllability.
• Subtle and important structural differences exist between BA networks and typical scale-free networks.

A maximum entropy (ME) method to generate typical scale-free networks has been recently introduced. We investigate the controllability of ME networks and Barabási–Albert preferential attachment networks. Our experimental results show that ME networks are significantly more easily controlled than BA networks of the same size and the same degree distribution. Moreover, the control profiles are used to provide insight into control properties of both classes of network. We identify and classify the driver nodes and analyze the connectivity of their neighbors. We find that driver nodes in ME networks have fewer mutual neighbors and that their neighbors have lower average degree. We conclude that the properties of the neighbors of driver node sensitively affect the network controllability. Hence, subtle and important structural differences exist between BA networks and typical scale-free networks of the same degree distribution.