Skip to main content
SpringerLink
Log in

Controllability in Directed Complex Networks: Granular Computing Perspective

  • Conference paper
  • First Online:
Book cover Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9437))

  • 1437 Accesses

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.

G. Xie–This research is supported by the National Natural Science Foundation of China (Grant No. 60975032 and Grant No. 61402319), and Research Project Supported by Shanxi Scholarship Council of China (Grant No. 2013-031).

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  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)

    Article  Google Scholar 

  2. Barabsi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of networks. Adv. Phys. 51(4), 1079–1187 (2002)

    Article  Google Scholar 

  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. Liu, Y.Y., Slotine, J.J., Barabsi, A.L.: Control centrality and hierarchical structure in complex networks. Plos One 7(9), e44459 (2012)

    Article  Google Scholar 

  6. Albert, R., Barabsi, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)

    Article  MathSciNet  Google Scholar 

  7. Boccalettia, S., Latorab, V., Morenod, Y., Chavezf, M., Hwanga, D.U.: Complex networks: structure and dynamics. Phys. Rep. 424(4), 175–308 (2006)

    Article  MathSciNet  Google Scholar 

  8. Strogatz, S.H.: Exploring complex networks. Nature 410(6825), 268–276 (2001)

    Article  MATH  Google Scholar 

  9. Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  11. Yu, W.W., Chen, G.R., Lü, J.H.: On pinning synchronization of complex dynamical networks. Automatica 45(2), 429–435 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Liu, Y.Y., Jean, J.S., Albert, L.B.: Controllability of complex networks. Nature 473(7346), 167–173 (2011)

    Article  Google Scholar 

  13. Nepusz, T., Vicsek, T.: Controlling edge dynamics in complex networks. Nat. Phys. 8(7), 568–573 (2012)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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. Zadeh, L.A.: A theory of approximate reasoning. Mach. Intell. 9, 149–194 (1979)

    MathSciNet  Google Scholar 

  17. Garcia, C.E., Prett, D.M., Morari, M.: Model predictive control: theory and practicea survey. Automatica 25(3), 335–348 (1989)

    Article  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  19. Burkard, R., DellAmico, M., Martello, S.: Assignment Problems. Revised Reprint. Siam, Philadelphia (2009)

    Book  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. College of Information Engineering, Taiyuan University of Technology, Taiyuan, 030024, Shanxi, China

    Yunyun Yang, Gang Xie & Zehua Chen

Authors
  1. Yunyun Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gang Xie
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zehua Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gang Xie .

Editor information

Editors and Affiliations

  1. University of Regina, Regina, SK, Canada

    Yiyu Yao

  2. Tianjin University, Tianjin, China

    Qinghua Hu

  3. Chongqing University of Posts and Telecommunications, Chongqing, China

    Hong Yu

  4. University of Kansas, Lawrence, KS, USA

    Jerzy W. Grzymala-Busse

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Yang, Y., Xie, G., Chen, Z. (2015). Controllability in Directed Complex Networks: Granular Computing Perspective. In: Yao, Y., Hu, Q., Yu, H., Grzymala-Busse, J.W. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. Lecture Notes in Computer Science(), vol 9437. Springer, Cham. https://doi.org/10.1007/978-3-319-25783-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25783-9_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25782-2

  • Online ISBN: 978-3-319-25783-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation