Article | Published:

Controllability of complex networks

Nature volume 473, pages 167173 (12 May 2011) | Download Citation

Abstract

The ultimate proof of our understanding of natural or technological systems is reflected in our ability to control them. Although control theory offers mathematical tools for steering engineered and natural systems towards a desired state, a framework to control complex self-organized systems is lacking. Here we develop analytical tools to study the controllability of an arbitrary complex directed network, identifying the set of driver nodes with time-dependent control that can guide the system’s entire dynamics. We apply these tools to several real networks, finding that the number of driver nodes is determined mainly by the network’s degree distribution. We show that sparse inhomogeneous networks, which emerge in many real complex systems, are the most difficult to control, but that dense and homogeneous networks can be controlled using a few driver nodes. Counterintuitively, we find that in both model and real systems the driver nodes tend to avoid the high-degree nodes.

Access optionsAccess options

Rent or Buy article

Get time limited or full article access on ReadCube.

from$8.99

All prices are NET prices.

References

  1. 1.

    Mathematical description of linear dynamical systems. J. Soc. Indus. Appl. Math. Ser. A 1, 152–192 (1963)

  2. 2.

    Introduction to Dynamic Systems: Theory, Models, & Applications (Wiley, 1979)

  3. 3.

    & Applied Nonlinear Control (Prentice-Hall, 1991)

  4. 4.

    , & Rate control for communication networks: shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49, 237–252 (1998)

  5. 5.

    The Mathematics of Internet Congestion Control (Birkhäuser, 2004)

  6. 6.

    , , & Layering as optimization decomposition: a mathematical theory of network architectures. Proc. IEEE 95, 255–312 (2007)

  7. 7.

    & Pinning control of scale-free dynamical networks. Physica A 310, 521–531 (2002)

  8. 8.

    & On partial contraction analysis for coupled nonlinear oscillators. Biol. Cybern. 92, 38–53 (2005)

  9. 9.

    , , & Controllability of complex networks via pinning. Phys. Rev. E 75, 046103 (2007)

  10. 10.

    , & On pinning synchronization of complex dynamical networks. Automatica 45, 429–435 (2009)

  11. 11.

    et al. How to turn a genetic circuit into a synthetic tunable oscillator, or a bistable switch. PLoS ONE 4, e8083 (2009)

  12. 12.

    Exploring complex networks. Nature 410, 268–276 (2001)

  13. 13.

    & Evolution of Networks: From Biological Nets to the Internet and WWW (Oxford Univ. Press, 2003)

  14. 14.

    , & The Structure and Dynamics of Networks (Princeton Univ. Press, 2006)

  15. 15.

    Scale-Free Networks: Complex Webs in Nature and Technology (Oxford Univ. Press, 2007)

  16. 16.

    & Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97 (2002)

  17. 17.

    in Proc. 43rd IEEE Conf. Decision Contr. Vol. 3. 2467–2472 (2004)

  18. 18.

    & Controllability analysis of networks. Phys. Rev. E 75, 56110 (2007)

  19. 19.

    , , & Controllability of a leader–follower dynamic network with switching topology. IEEE Trans. Automat. Contr. 53, 1009–1013 (2008)

  20. 20.

    , , & Controllability of multi-agent systems from a graph-theoretic perspective. SIAM J. Contr. Optim. 48, 162–186 (2009)

  21. 21.

    & Slave nodes and the controllability of metabolic networks. N. J. Phys. 11, 113047 (2009)

  22. 22.

    & Graph Theoretic Methods in Multiagent Networks (Princeton Univ. Press, 2010)

  23. 23.

    , , & Predicting synthetic rescues in metabolic networks. Mol. Syst. Biol. 4, 168 (2008)

  24. 24.

    & Evolution and Structure of the Internet: A Statistical Physics Approach (Cambridge Univ. Press, 2004)

  25. 25.

    , , , & Using the principle of entropy maximization to infer genetic interaction networks from gene expression patterns. Proc. Natl Acad. Sci. USA 103, 19033–19038 (2006)

  26. 26.

    Structural controllability. IEEE Trans. Automat. Contr. 19, 201–208 (1974)

  27. 27.

    & Structural controllability of multi-input linear systems. IEEE Trans. Automat. Contr. 21, 203–212 (1976)

  28. 28.

    & On contraction analysis for nonlinear systems. Automatica 34, 683–696 (1998)

  29. 29.

    , , & Second-order consensus for multiagent systems with directed topologies and nonlinear dynamics. IEEE Trans. Syst. Man Cybern. B 40, 881–891 (2010)

  30. 30.

    & An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 225–231 (1973)

  31. 31.

    , & Error and attack tolerance of complex networks. Nature 406, 378–382 (2000)

  32. 32.

    , , & Resilience of the Internet to random breakdowns. Phys. Rev. Lett. 85, 4626–4628 (2000)

  33. 33.

    & Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86, 3200–3203 (2001)

  34. 34.

    , , & Heterogeneity in oscillator networks: are smaller worlds easier to synchronize? Phys. Rev. Lett. 91, 014101 (2003)

  35. 35.

    & On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5, 17–60 (1960)

  36. 36.

    Random Graphs (Cambridge Univ. Press, 2001)

  37. 37.

    & Emergence of scaling in random networks. Science 286, 509–512 (1999)

  38. 38.

    , & Universal behavior of load distribution in scale-free networks. Phys. Rev. Lett. 87, 278701 (2001)

  39. 39.

    & Connected component in random graphs with given expected degree sequences. Ann. Combin. 6, 125–145 (2002)

  40. 40.

    & Specificity and stability in topology of protein networks. Science 296, 910–913 (2002)

  41. 41.

    et al. Network motifs: simple building blocks of complex networks. Science 298, 824–827 (2002)

  42. 42.

    & The Bethe lattice spin glass revisited. Eur. Phys. J. B 20, 217–233 (2001)

  43. 43.

    & The number of matchings in random graphs. J. Stat. Mech. 05, 05003 (2006)

  44. 44.

    & Maximum matching on random graphs. Preprint at 〈〉 (2003)

  45. 45.

    , , & Network robustness and fragility: percolation on random graphs. Phys. Rev. Lett. 85, 5468–5471 (2000)

  46. 46.

    , & Cut-offs and finite size effects in scale-free networks. Eur. Phys. J. B 38, 205–209 (2004)

  47. 47.

    & Matching Theory (American Mathematical Society, 2009)

  48. 48.

    & Core percolation in random graphs: a critical phenomena analysis. Eur. Phys. J. B 24, 339–352 (2001)

  49. 49.

    Assortative mixing in networks. Phys. Rev. Lett. 89, 208701 (2002)

  50. 50.

    , & Dynamical and correlation properties of the Internet. Phys. Rev. Lett. 87, 258701 (2001)

Download references

Acknowledgements

We thank C. Song, G. Bianconi, H. Zhou, L. Vepstas, N. Gulbahce, H. Jeong, Y.-Y. Ahn, B. Barzel, N. Blumm, D. Wang, Z. Qu and Y. Li for discussions. This work was supported by the Network Science Collaborative Technology Alliance sponsored by the US Army Research Laboratory under Agreement Number W911NF-09-2-0053; the Office of Naval Research under Agreement Number N000141010968; the Defense Threat Reduction Agency awards WMD BRBAA07-J-2-0035 and BRBAA08-Per4-C-2-0033; and the James S. McDonnell Foundation 21st Century Initiative in Studying Complex Systems.

Author information

Affiliations

  1. Center for Complex Network Research and Departments of Physics, Computer Science and Biology, Northeastern University, Boston, Massachusetts 02115, USA

    • Yang-Yu Liu
    •  & Albert-László Barabási
  2. Center for Cancer Systems Biology, Dana-Farber Cancer Institute, Boston, Massachusetts 02115, USA

    • Yang-Yu Liu
    •  & Albert-László Barabási
  3. Nonlinear Systems Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA

    • Jean-Jacques Slotine
  4. Department of Mechanical Engineering and Department of Brain and Cognitive Sciences, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA

    • Jean-Jacques Slotine
  5. Department of Medicine, Brigham and Women’s Hospital, Harvard Medical School, Boston, Massachusetts 02115, USA

    • Albert-László Barabási

Authors

  1. Search for Yang-Yu Liu in:

  2. Search for Jean-Jacques Slotine in:

  3. Search for Albert-László Barabási in:

Contributions

All authors designed and did the research. Y.-Y.L. analysed the empirical data and did the analytical and numerical calculations. A.-L.B. was the lead writer of the manuscript.

Competing interests

The authors declare no competing financial interests.

Corresponding author

Correspondence to Albert-László Barabási.

Supplementary information

PDF files

  1. 1.

    Supplementary Information

    This file contains Supplementary Text and Data comprising: 1 Introduction; II Previous Work and Relation of Controllability to Other Problems; III Structural Control Theory; IV Maximum Matching; V Control Robustness and VI Network Datasets (see Contents list for full details), Supplementary Figures 1-11 with legends, Supplementary Table 1 and additional references.

About this article

Publication history

Received

Accepted

Published

DOI

https://doi.org/10.1038/nature10011

Comments

By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.