Dominating scale-free networks with variable scaling exponent: heterogeneous networks are not difficult to control

The possibility of controlling and directing a complex system's behavior at will is rooted in its interconnectivity and can lead to significant advances in disparate fields, ranging from nationwide energy saving to therapies that involve multiple targets. In this work, we address complex network controllability from the perspective of the minimum dominating set (MDS). Our theoretical calculations, simulations using artificially generated networks as well as real-world network analyses show that the more heterogeneous a network degree distribution is, the easier it is to control the entire system. We demonstrate that relatively few nodes are needed to control the entire network if the power-law degree exponent is smaller than 2, whereas many nodes are required if it is larger than 2.

[1]  Dieter Rautenbach,et al.  Random Procedures for Dominating Sets in Graphs , 2010, Electron. J. Comb..

[2]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .

[3]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[4]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[5]  Lin Gao,et al.  Control range: a controllability-based index for node significance in directed networks , 2012 .

[6]  Ernesto Estrada,et al.  'Clumpiness' mixing in complex networks , 2008, 0905.4096.

[7]  M. Newman Power laws, Pareto distributions and Zipf's law , 2005 .

[8]  S. Shen-Orr,et al.  Superfamilies of Evolved and Designed Networks , 2004, Science.

[9]  Jun Dong,et al.  Understanding network concepts in modules , 2007, BMC Systems Biology.

[10]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[11]  Shuji Kijima,et al.  Probability and Computation , 2011, 2011 Second International Conference on Networking and Computing.

[12]  Peter Nijkamp,et al.  Accessibility of Cities in the Digital Economy , 2004, cond-mat/0412004.

[13]  A. Vespignani Predicting the Behavior of Techno-Social Systems , 2009, Science.

[14]  Alessandro Vespignani,et al.  Reaction–diffusion processes and metapopulation models in heterogeneous networks , 2007, cond-mat/0703129.

[15]  Sabu M. Thampi,et al.  An ACO Algorithm for Effective Cluster Head Selection , 2011, ArXiv.

[16]  Colin Cooper,et al.  Lower Bounds and Algorithms for Dominating Sets in Web Graphs , 2005, Internet Math..

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

[18]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

[19]  B Kahng,et al.  Synchronization transition of heterogeneously coupled oscillators on scale-free networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Daqing Li,et al.  Download details: IP Address: 129.74.250.206 , 2011 .

[21]  Adilson E. Motter,et al.  Slave nodes and the controllability of metabolic networks , 2009, 0911.5518.

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

[23]  A. Barabasi,et al.  Network medicine : a network-based approach to human disease , 2010 .

[24]  K. Goh,et al.  Fractality and self-similarity in scale-free networks , 2007 .

[25]  Jure Leskovec,et al.  Signed networks in social media , 2010, CHI.

[26]  Mikko Alava,et al.  Correlations in bipartite collaboration networks , 2005, physics/0508027.

[27]  Orhan Dagdeviren,et al.  A Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks , 2006, International Conference on Computational Science.

[28]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[29]  Magnus Egerstedt,et al.  Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective , 2009, SIAM J. Control. Optim..

[30]  M. Ng,et al.  Control of Boolean networks: hardness results and algorithms for tree structured networks. , 2007, Journal of theoretical biology.

[31]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[32]  F. Müller,et al.  Few inputs can reprogram biological networks , 2011, Nature.

[33]  Colin Cooper,et al.  An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm , 2009, Discret. Appl. Math..

[34]  Matthieu Latapy,et al.  Efficient and simple generation of random simple connected graphs with prescribed degree sequence , 2005, J. Complex Networks.

[35]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[36]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[37]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[38]  A. Lombardi,et al.  Controllability analysis of networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[39]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.