Abstract
In this study we investigate the change in network controllability, the ability to fully control the state of a network by applying external inputs, as edges of a network are removed according to their edge weight. A significant challenge to analyzing real-world networks is that surveys to capture network structure are almost always incomplete. While strong connections may be easy to detect, weak interactions, modeled by small edge weights are the most likely to be omitted. The incompleteness of network data leads to biasing calculated network statistics—including network controllability—away from the true values [16]. To get at the sensitivity of network control to these inaccuracies, we investigate the evolution of the minimum number of independent inputs needed to fully control the system as links are removed based on their weights. We find that the correlation between edge weight and the degrees of their adjacent nodes dominates the change in network controllability. In our surveyed real networks, this correlation is positive, meaning the number of controls increases quickly when weaker links are targeted first. We confirm this result with synthetic networks from both the scale-free and the Erdös-Rényi types. We also look at the evolution of the control profile, a network statistic that captures the ratio of the different functional types of controls.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
The library used to work on the networks is accessible here: Weight Analysis.
- 2.
To compare two sequences of weight cuts \( \{w\}_{i=1}^n \) and \( \{\tilde{w}\}_{i=1}^n \), we use the \( l^1 \) distance between them, \( d(w, \tilde{w}) = \sum _{i = 1}^n |w_i-\tilde{w}_i| \).
References
Albert, R., Jeong, H., Barabási, A.-L.: Error and attack tolerance of complex networks. Nature 406(6794), 378–382 (2000)
Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Bloch, F., Hansen, W.W., Packard, M.: Nuclear induction. Phys. Rev. 70(7–8), 460–474 (1946)
Brockett, R.: Finite Dimensional Linear Systems. Wiley (1970)
Commault, C., Dion, J.-M., Van der Woude, J.W.: Characterization of generic properties of linear structured systems for efficient computations. Kybernetika 38(5), 503–520 (2002)
Cowan, N.J., Chastain, E.J., Vilhena, D.A., Freudenberg, J.S., Bergstrom, C.T.: Nodal dynamics, not degree distributions, determine the structural controllability of complex networks. PLoS ONE 7(6), e38398 (2012)
Daniel, W.: Applied nonparametric statistics. In: The Duxbury advanced series in Statistics and Decision Sciences. PWS-Kent Publ. (1990)
Li, M.-X., Jiang, Z.-Q., Xie, W.-J., Miccichè, S., Tumminello, M., Zhou, W.-X., Mantegna, R.N.: A comparative analysis of the statistical properties of large mobile phone calling networks. Sci. Rep. 4 (2014)
Lin, C.-T.: Structural controllability. IEEE Trans. Autom. Control 19(3) (1974)
Liu, Y.-Y., Slotine, J.-J., Barabási, A.-L.: Controllability of complex networks. Nature 473, 167–173 (2011)
Murota, K.: Matrices and Matroids for Systems Analysis. Springer, Berlin (2000)
Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)
Nie, S., Wang, X., Zhang, H., Li, Q., Wang, B.: Robustness of controllability for networks based on edge-attack. PloS one 9(2), e89066 (2014)
Parekh, D., Ruths, D., Ruths, J.: Reachability-based robustness of network controllability under node and edge attacks. In: Workshop on Complex Networks and their Applications, Marrakech, Morocco (2014)
Pasqualetti, F., Zampieri, S., Bullo, F.: Controllability metrics, limitations and algorithms for complex networks. IEEE Trans. Control Netw. Syst. 1(1), 40–52 (2014)
Platig, J., Ott, E., Girvan, M.: Robustness of network measures to link errors. Phys. Rev. E 88(6), 062812 (2013)
Posfai, M., Liu, Y.-Y., Slotine, J.-J., Barabási, A.-L.: Effect of correlations on network controllability. Sci. Rep. 3 (2013)
Pu, C.-L., Pei, W.-J., Michaelson, A.: Robustness analysis of network controllability. Physica A 391(18), 4420–4425 (2012)
Renyi, A., Erdos, P.: On random graphs. Publicationes Mathematicae 6(290–297), 5 (1959)
Ruths, J., Ruths, D.: Control profiles of complex networks. Science (New York, N.Y.) 343, 1373–1376 (2014)
Shields, R.W., Pearson, J.B.: Structural controllability of multi-input linear systems. IEEE Trans. Autom. Control AC-21(2), 203–212 (1976)
Toivonen, R., Kumpula, J.M., Saramki, J., Onnela, J.-P., Kertsz, J., Kaski, K.: The role of edge weights in social networks: modelling structure and dynamics (2007)
Wang, B., Gao, L., Gao, Y., Deng, Y.: Maintain the structural controllability under malicious attacks on directed networks. EPL (Europhys. Lett.) 101(5), 58003 (2013)
Yan, G., Ren, J., Lai, Y.-C., Lai, C.-H., Li, B.: Controlling complex networks: how much energy is needed? Phys. Rev. Lett. 108(21), 218703 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Monnot, B., Ruths, J. (2016). Sensitivity of Network Controllability to Weight-Based Edge Thresholding. In: Cherifi, H., Gonçalves, B., Menezes, R., Sinatra, R. (eds) Complex Networks VII. Studies in Computational Intelligence, vol 644. Springer, Cham. https://doi.org/10.1007/978-3-319-30569-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-30569-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30568-4
Online ISBN: 978-3-319-30569-1
eBook Packages: EngineeringEngineering (R0)