title: Controllability of deterministic networks with the identical degree sequence.
abstract: Controlling complex network is an essential problem in network science and engineering. Recent advances indicate that the controllability of complex network is dependent on the network's topology. Liu and Barabási, et.al speculated that the degree distribution was one of the most important factors affecting controllability for arbitrary complex directed network with random link weights. In this paper, we analysed the effect of degree distribution to the controllability for the deterministic networks with unweighted and undirected. We introduce a class of deterministic networks with identical degree sequence, called (x,y)-flower. We analysed controllability of the two deterministic networks ((1, 3)-flower and (2, 2)-flower) by exact controllability theory in detail and give accurate results of the minimum number of driver nodes for the two networks. In simulation, we compare the controllability of (x,y)-flower networks. Our results show that the family of (x,y)-flower networks have the same degree sequence, but their controllability is totally different. So the degree distribution itself is not sufficient to characterize the controllability of deterministic networks with unweighted and undirected.
authors.affiliation: School of Computer Science, Shaanxi Normal University, Xi'an, Shaanxi, 710062, P. R. China; School of Computer Science, Qinghai Normal University, Xining, Qinghai, 810008, P. R. China.
authors.forename: Xiujuan
authors.initials: X
authors.lastname: Ma
authors.affiliation: School of Computer Science, Qinghai Normal University, Xining, Qinghai, 810008, P. R. China.
authors.forename: Haixing
authors.initials: H
authors.lastname: Zhao
authors.affiliation: Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui, 230026, P. R. China.
authors.forename: Binghong
authors.initials: B
authors.lastname: Wang
mesh_terms: D008962:Models, Theoretical