Analytical controllability of deterministic scale-free networks and Cayley trees

Abstract

According to the exact controllability theory, the controllability is investigated analytically for two typical types of self-similar bipartite networks, i.e., the classic deterministic scale-free networks and Cayley trees. Due to their self-similarity, the analytical results of the exact controllability are obtained, and the minimum sets of driver nodes (drivers) are also identified by elementary transformations on adjacency matrices. For these two types of undirected networks, no matter their links are unweighted or (nonzero) weighted, the controllability of networks and the configuration of drivers remain the same, showing a robustness to the link weights. These results have implications for the control of real networked systems with self-similarity.

arXiv comment7 pages, 4 figures, 1 table; revised manuscript; added discussion about the general case of DSFN; added 3 references

References in corpus (6)

• Fast algorithm for detecting community structure in networks
• Exact Controllability of Complex Networks
• Deterministic Scale-Free Networks
• Controlling complex networks: How much energy is needed?
• Eigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: Analytical results and applications
• Exactly solvable scale-free network model

Cited by in corpus (1)

• Global and partitioned reconstructions of undirected complex networks