Advertisement

Controllability in Directed Complex Networks: Granular Computing Perspective

  • Yunyun Yang
  • Gang XieEmail author
  • Zehua Chen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9437)

Abstract

Controlling complex networks to a desired state has been a widespread sense in contemporary science. Usually, we seek a maximum matching of complex networks by matching theory and control those unmatched nodes to achieve the purpose of controlling complex networks. However, for complex networks with high dimensions, it is hard to find its maximum matching or there are copious unmatched nodes that need to be controlled. Therefore, controlling complex networks is extremely strenuous. Motivated by the idea of granular computing (GrC), we take a fine graining preprocessing to the whole complex networks and obtain several different granules. Then find the maximum matching in every granule and control those unmatched nodes to procure the goal of controlling the entire network. At last, the related key problems in GrC-based controllability of complex networks processing framework are discussed.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Barabsi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of networks. Adv. Phys. 51(4), 1079–1187 (2002)CrossRefGoogle Scholar
  4. 4.
    Yuan, Z.Z., Zhao, C., Di, Z.R., Wang, W.X., Lai, Y.C.: Exact controllability of complex networks. Nat. Commun. 4 (2013)Google Scholar
  5. 5.
    Liu, Y.Y., Slotine, J.J., Barabsi, A.L.: Control centrality and hierarchical structure in complex networks. Plos One 7(9), e44459 (2012)CrossRefGoogle Scholar
  6. 6.
    Albert, R., Barabsi, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Boccalettia, S., Latorab, V., Morenod, Y., Chavezf, M., Hwanga, D.U.: Complex networks: structure and dynamics. Phys. Rep. 424(4), 175–308 (2006)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Strogatz, S.H.: Exploring complex networks. Nature 410(6825), 268–276 (2001)CrossRefGoogle Scholar
  9. 9.
    Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Li, X., Wang, X.F., Chen, G.R.: Pinning a complex dynamical network to its equilibrium. IEEE Trans. Circ. Syst. I Regul. Pap. 51(10), 2074–2087 (2004)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Yu, W.W., Chen, G.R., Lü, J.H.: On pinning synchronization of complex dynamical networks. Automatica 45(2), 429–435 (2009)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Liu, Y.Y., Jean, J.S., Albert, L.B.: Controllability of complex networks. Nature 473(7346), 167–173 (2011)CrossRefGoogle Scholar
  13. 13.
    Nepusz, T., Vicsek, T.: Controlling edge dynamics in complex networks. Nat. Phys. 8(7), 568–573 (2012)CrossRefGoogle Scholar
  14. 14.
    Wang, W.X., Ni, X., Lai, Y.C., Grebogi, C.: Optimizing controllability of complex networks by minimum structural perturbations. Phys. Rev. E 85(2), 026115 (2012)CrossRefGoogle Scholar
  15. 15.
    Yao, Y.Y.: Granular computing: basic issues and possible solutions. In: Proceedings of the 5th Joint Conference on Information Sciences, vol. 1, pp. 186–189 (2000)Google Scholar
  16. 16.
    Zadeh, L.A.: A theory of approximate reasoning. Mach. Intell. 9, 149–194 (1979)MathSciNetGoogle Scholar
  17. 17.
    Garcia, C.E., Prett, D.M., Morari, M.: Model predictive control: theory and practicea survey. Automatica 25(3), 335–348 (1989)CrossRefGoogle Scholar
  18. 18.
    Sontag, E.D.: Kalmans controllability rank condition: from linear to nonlinear. In: Antoulas, A.C. (ed.) Mathematical System Theory, pp. 453–462. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  19. 19.
    Burkard, R., DellAmico, M., Martello, S.: Assignment Problems. Revised Reprint. Siam, Philadelphia (2009)CrossRefGoogle Scholar
  20. 20.
    Hopcroft, J.E., Karp, R.M.: An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225–231 (1973)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Chen, C.L.P., Zhang, C.Y.: Data-intensive applications, challenges, techniques and technologies: a survey on Big Data. Inf. Sci. 275, 314–347 (2014)CrossRefGoogle Scholar
  22. 22.
    Chatterjee, A., Das, D., Naskar, M.K., Pal, N., Mukherjee, A.: Heuristic for maximum matching in directed complex networks. In: Proceedings of the 2th IEEE International Conference on the Advances in Computing, Communications and Informatics, pp. 1146–1151 (2013)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

Authors and Affiliations

  1. 1.College of Information EngineeringTaiyuan University of TechnologyTaiyuanChina

Personalised recommendations