Estimating the minimum control count of random network models

The study of controllability of complex networks has introduced the minimum number of controls required for full controllability as a new network measure of interest. This network measure, like many others, is non-trivial to compute. As a result, establishing the significance of minimum control counts (MCCs) in real networks using random network null models is expensive. Here we derive analytic estimates for the expected MCCs of networks drawn from three commonly-used random network models. Our estimates show good agreement with exact control counts. Furthermore, the analytic expressions we derive offer insights into the structures within each random network model that induce the need for controls.

[1]  Jari Saramäki,et al.  Small But Slow World: How Network Topology and Burstiness Slow Down Spreading , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Brian W. Rogers,et al.  Meeting Strangers and Friends of Friends: How Random are Social Networks? , 2007 .

[3]  Hans J. Herrmann,et al.  Mitigation of malicious attacks on networks , 2011, Proceedings of the National Academy of Sciences.

[4]  Roberto Garrappa,et al.  Some Formulas for Sums of Binomial Coefficients and Gamma Functions , 2007 .

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

[6]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[7]  S. Hosoe.  Determination of generic dimensions of controllable subspaces and its application , 1980 .

[8]  Derek Ruths,et al.  Control Profiles of Complex Networks , 2014, Science.

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

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

[11]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[12]  G. N. Watson.  A Note on Gamma Functions , 1959 .

[13]  Jie Sun,et al.  Controllability transition and nonlocality in network control. , 2013, Physical review letters.

[14]  Christian Commault,et al.  Characterization of generic properties of linear structured systems for efficient computations , 2002, Kybernetika.

[15]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[16]  Cristinel Mortici,et al.  New approximation formulas for evaluating the ratio of gamma functions , 2010, Math. Comput. Model..

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

[18]  Jie Ren,et al.  Controlling complex networks: How much energy is needed? , 2012, Physical review letters.

[19]  Božidar V. Popović,et al.  Mathematical and Computer Modelling , 2011 .

[20]  Albert-László Barabási,et al.  Control Centrality and Hierarchical Structure in Complex Networks , 2012, PloS one.

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

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

[23]  Derek Ruths,et al.  On the contributions of topological features to transcriptional regulatory network robustness , 2012, BMC Bioinformatics.

[24]  Li Wang,et al.  Corrigendum: Ultrafast universal quantum control of a quantum-dot charge qubit using Landau–Zener–Stückelberg interference , 2013, Nature Communications.

[25]  Albert-László Barabási,et al.  Effect of correlations on network controllability , 2012, Scientific Reports.

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

[27]  Endre Csóka,et al.  Emergence of bimodality in controlling complex networks , 2013, Nature Communications.

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