Skip to main content
SpringerLink
Log in

Robustness of Network Controllability under Edge Removal

  • Conference paper
Complex Networks IV

Part of the book series: Studies in Computational Intelligence ((SCI,volume 476))

Abstract

We introduce a quantitative measure of robustness of network controllability. Given a set of control nodes which drive the network, we investigate the effect of edge removal on the number of controllable nodes. We find that the mean degree of the network is a major factor in determining the robustness of random networks. Nonetheless, a comparison between real and random networks indicates a statistically significant difference which points to additional factors that influence the robustness of control of real complex networks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Erdos, P., Renyi, A.: On random graphs. Publicationes Mathematicae 6, 290–297 (1959)

    MathSciNet  Google Scholar 

  2. Glober, K., Silverman, L.M.: Characterization of structural controllability. IEEE Transactions on Automatic Control AC-21(4), 534–537 (1976)

    Google Scholar 

  3. Hosoe, S., Matsumoto, K.: On the irreducibility condition in the structural controllability theorem. IEEE Transactions on Automatic Control AC-24(6), 963–966 (1979)

    Article  MathSciNet  Google Scholar 

  4. Kitano, H.: Systems biology: A brief overview. Science 295(5560), 1662–1664 (2002)

    Article  Google Scholar 

  5. Lazer, D., Pentland, A., Adamic, L., Aral, S.: Life in the network: the coming age of computational social science. Science 323(5915), 721–723 (2009)

    Article  Google Scholar 

  6. Li, F., Long, T., Lu, Y., Ouyang, Q., Tang, C.: The yeast cell-cycle network is robustly designed. Proceedings of the National Academy of Sciences of USA 101(14), 4781–4786

    Google Scholar 

  7. Lin, C.-T.: Structural Controllability. IEEE Transactions on Automatic Control AC-19(3), 201–208 (1974)

    Google Scholar 

  8. Liu, Y.-Y., Slotine, J.-J., Barabasi, A.-L.: Controllability of complex networks. Nature 473, 167–173 (2011)

    Article  Google Scholar 

  9. Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: Simple building blocks of complex networks. Science 298(5594), 824–827 (2002)

    Article  Google Scholar 

  10. Rahmani, A.R., Ji, M., Mesbahi, M., Egerstedt, M.B.: Controllability of multi-agent systems from a graph-theoretic perspective. SIAM Journal on Control and Optimization 48(1), 162–186 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  11. Shields, R.W., Pearson, J.B.: Structural controllability of multi-input linear systems. IEEE Transactions on Automatic Control AC-21(2), 203–212 (1976)

    Article  MathSciNet  Google Scholar 

  12. Sun, S., Ling, L., Zhang, N., Li, G., Chen, R.: Topological structure analysis of the protein-protein interaction network in budding yeast. Nucleic Acids Research 31(9), 2443–2450 (2003)

    Article  Google Scholar 

  13. Tanner, H.G.: On the controllability of nearest neighbor interconnections. In: CDC 43rd IEEE Conference, vol. 3, pp. 2467–2472 (2004)

    Google Scholar 

  14. Ulanowicz, R.E., Bondavalli, C., Egnotovich, M.: Network analysis of trophic dynamics in south florida ecosystem, fy 97: The florida bay ecosystem. Technical Report UMCES-CBL 98-123, Chesapeake Biological Laboratory (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Singapore University of Technology and Design, 20 Dover Drive, Singapore, Singapore

    Justin Ruths

  2. McGill University, 3480 University Street, Montreal, Canada

    Derek Ruths

Authors
  1. Justin Ruths
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Derek Ruths
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Justin Ruths .

Editor information

Editors and Affiliations

  1. 20 Queensberry st. # 4, Boston, 02215, Massachusetts, USA

    Gourab Ghoshal

  2. Northwestern University, 2145 Sheridan Rd, Evanston, 60208, Illinois, USA

    Julia Poncela-Casasnovas

  3. , Institut fuer Informatik, Freie Universitaet Berlin, Königin-Luise-Str. 24/26, Berlin, 14195, Germany

    Robert Tolksdorf

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ruths, J., Ruths, D. (2013). Robustness of Network Controllability under Edge Removal. In: Ghoshal, G., Poncela-Casasnovas, J., Tolksdorf, R. (eds) Complex Networks IV. Studies in Computational Intelligence, vol 476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36844-8_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36844-8_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36843-1

  • Online ISBN: 978-3-642-36844-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation