A Degree-first Greedy Search Algorithm for the Evaluation of Structural Controllability of Real World Directed Complex Networks

Ubiquitous data flow through a directed complex network requires the complete structural controllability of the network. For evaluating the structural controllability of any network, determination of maximum matching in the network is a cardinal task and has always been a problem of immense concern. Its solution is mandatory in structural control theory for controlling real world complex networks. The existing classical approach through the Hopcroft-Karp algorithm and other proposed algorithms require the determination of the bipartite equivalent graph (i.e., network), which belongs to the NP-complete class of problems. In this article, we propose a degree-first greedy search algorithm to determine maximum matching in unipartite graphs without determining its bipartite equivalent. Thus this classical problem of the NP-Complete class can be solved using the heuristic, with reduced complexity. This algorithm can be efficiently used to find maximum matching in most of the real world complex networks that follow Erdős-Renyi model. Simulation results obtained using our heuristic reveal that dense and homogenous networks can be controlled with fewer controller nodes popularly termed as driver nodes, compared to the sparse inhomogeneous networks.

[1]  Amitava Mukherjee,et al.  Heuristic for maximum matching in directed complex networks , 2013, 2013 International Conference on Advances in Computing, Communications and Informatics (ICACCI).

[2]  T. Masaki.  Structure and Dynamics , 2002 .

[3]  H. Mayeda,et al.  Strong Structural Controllability , 1979 .

[4]  Albert-László Barabási,et al.  Controllability of complex networks , 2011, Nature.

[5]  Jean-Loup Guillaume,et al.  Bipartite graphs as models of complex networks , 2006 .

[6]  Guido Caldarelli,et al.  Scale-Free Networks , 2007 .

[7]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[8]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[9]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[10]  Noah J. Cowan,et al.  Nodal Dynamics, Not Degree Distributions, Determine the Structural Controllability of Complex Networks , 2011, PloS one.

[11]  ZVI GALIL,et al.  Efficient algorithms for finding maximum matching in graphs , 1986, CSUR.

[12]  R. Kálmán.  Mathematical description of linear dynamical systems , 1963 .

[13]  B. Bollobás.  The evolution of random graphs , 1984 .

[14]  H.G. Tanner,et al.  On the controllability of nearest neighbor interconnections , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[15]  Guangming Xie,et al.  Controllability of a Leader–Follower Dynamic Network With Switching Topology , 2008, IEEE Transactions on Automatic Control.

[16]  T. S. Evans,et al.  Complex networks , 2004 .

[17]  Albert-László Barabási,et al.  Scale-Free Networks: A Decade and Beyond , 2009, Science.

[18]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[19]  Ching-tai Lin.  Structural controllability , 1974 .

[20]  Alessandro Panconesi,et al.  On the distributed complexity of computing maximal matchings , 1997, SODA '98.

[21]  Lenka Zdeborová,et al.  The number of matchings in random graphs , 2006, ArXiv.

[22]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[23]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[24]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.