Skip to main content

Advertisement

SpringerLink
Log in

Optimally Connected Hybrid Complex Networks with Windmill Graphs Backbone

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

The significance of the existing analysis methods in complex networks and easy access to the ever-increasing volume of information present the emergence of proposing new methods in various fields based on complex system ideas. However, these systems are usually faced with various random failures and intelligent attacks. Due to the nature of the components’ behaviors, the occurrence of the failures and faults in their operations and the alteration of their topologies are the most important problems. Since the complex systems are usually used as the infrastructures of other networks, their robustness against failures and the adoption of suitable precautions are necessary. Moreover, the small-world effect in most complex systems is one of the crucial structural features. The authors found that the relation between these two is not well-known and may even be in conflict in some networks. The main goal in this paper is to achieve an optimal topology by utilizing a robustness-oriented multi-objective trade-off optimization model (edge rewiring) to establish a peaceful relationship between the two requirements. By offering a proposed rewiring method with the small-world effect, which is called core-periphery Windmill property, the authors demonstrated that the generated networks are able to exhibit appropriate robustness even during intelligent attacks. The results obtained in terms of Windmill graphs are presented very good approximations to demonstrate the small-world effect. These graphs are used as the initial core in the construction of the optimized networks’ topologies.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Watts D J and Strogatz S H, Collective dynamics of small-world networks, Nature, 1998, 393(6684): 440–442.

    Article  MATH  Google Scholar 

  2. Wang H and Mieghem P V, Algebraic connectivity optimization via link addition, Proceedings of IEEE/ACM Bionetics, Hyogo, Japan, 2008, 25–28.

  3. Chan H and Akoglu L, Optimizing network robustness by edge rewiring: A general framework, Data Mining and Knowledge Discovery, 2016, 30(5): 1395–1425.

    Article  MathSciNet  MATH  Google Scholar 

  4. Evans T S, Exact solutions for network rewiring models, The European Physical Journal B, 2007, 56(1): 65–69.

    Article  Google Scholar 

  5. Herrmann H J, et al., Onion-like network topology enhances robustness against malicious attacks, Journal of Statistical Mechanics: Theory and Experiment, 2011, 2011(1): 01027.

    Article  Google Scholar 

  6. Chen G and Duan Z, Network synchronizability analysis: A graph-theoretic approach, Chaos: An Interdisciplinary Journal of Nonlinear Science, 2008, 18(3): 037102.

    Article  MathSciNet  MATH  Google Scholar 

  7. Youssef M N, Measure of robustness for complex networks, Ph.D. Thesis, Department of Electrical and Computer Engineering College of Engineering, Kansas State University, 2012.

  8. Ellens W, Effective graph resistance and other graph measures for network robustness, Master thesis, Mathematical Institute, University of Leiden, 2011.

  9. Trafton A, Synchronized brain waves enable rapid learning, MIT News: online: http://news.mit.edu/2014/synchronized-brain-waves-enable-rapid-learning-0612, June 2014.

  10. Luce R D and Perry A D, A method of matrix analysis of group structure, Psychometrika, 1949, 14(2): 95–116.

    Article  MathSciNet  Google Scholar 

  11. Newman M E J, The structure of scientic collaboration networks, PNAS, 2001, 98(2): 404–409.

    Article  MATH  Google Scholar 

  12. Estrada E, When local and global clustering of networks diverge, Linear Algebra and Its Applications, 2016, 488: 249–263.

    Article  MathSciNet  MATH  Google Scholar 

  13. Estrada E and Vargas-Estrada E, Distance-sum heterogeneity in graphs and complex networks, Applied Mathematics and Computation, 2012, 218: 10393–10405.

    Article  MathSciNet  MATH  Google Scholar 

  14. Fiedler M, Laplacian of graphs and algebraic connectivity, Combinatorics and Graph Theory, Banach Center Publications, 1989, 25(1): 57–70.

    Article  MathSciNet  MATH  Google Scholar 

  15. Bondy J A and Murty U S R, Graph Theory: Graduate Texts in Mathematics, Springer-Verlag, 2008.

  16. Bollobs B, Modern Graph Theory, Graduate Texts in Mathematics, Springer-Verlag, 1998, 184.

  17. Diestel R, Graph Theory, Graduate Texts in Mathematics, 4th Ed., Springer-Verlag, 2010, 173.

  18. Estrada E, The Structure of Complex Networks, Oxford University Press, Oxford, 2011.

    Book  Google Scholar 

  19. Milgram S, Behavioral study of obedience, Journal of Abnormal and Social Psychology, 1963, 67(4): 371–378.

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  21. Erdös P and Rényi A, On the evolution of random graphs, Publications of the Math. Inst. of the Hungarian Academy of Sci., 1960, 5: 17–61.

    MathSciNet  MATH  Google Scholar 

  22. Bollobs B, Probabilistic Combinatorics and Its Applications, American Mathematical Society, 1991.

  23. Albert R and Barabsi A L, Statistical mechanics of complex networks, Reviews of Modern Physics, 2002, 74(1): 47–97.

    Article  MathSciNet  Google Scholar 

  24. Bollobás B, Riodan B, Spencer J, et al., The degree sequence of a scale-free random graph process, Random Structures & Algorithms, 2001, 18(3): 279–290.

    Article  MathSciNet  MATH  Google Scholar 

  25. Barthelemy M, Spatial networks, Physics Reports, 2011, 499(13): 1–101.

    Article  MathSciNet  Google Scholar 

  26. Estrada E and Sheerin M, Random rectangular graphs, Physical Review E, 2015, 91(4): 042805.

    Article  MathSciNet  Google Scholar 

  27. Waxman B M, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, 1988, 6(9): 1617–1622.

    Article  Google Scholar 

  28. De Neve H and Mieghem P V, TAMCRA: A tunable accuracy multiple constraints routing algorithm, Computer Communications, 2000, 23(7): 667–679.

    Article  Google Scholar 

  29. Shaikh A, Rexford J, and Shin K G, Evaluating the impact of stale link state on quality-of-service routing, IEEE/ACM Transactions on Networking, 2001, 9(2): 162–176.

    Article  Google Scholar 

  30. Freeman L C, Centrality in social networks conceptual clarification, Social Networks, 1979, 1(3): 215–39.

    Article  MathSciNet  Google Scholar 

  31. Sabidussi G, The centrality index of a graph, Psychometrika, 1966, 31(4): 581–603.

    Article  MathSciNet  MATH  Google Scholar 

  32. Latora V and Marchiori M, Efficient behavior of small-world networks, Phys. Rev. Lett., 2001, 87(19): 198701.

    Article  Google Scholar 

  33. Dangalchev C, Residual closeness in networks, Physica A: Statistical Mechanics and Its Applications, 2006, 365(2): 556–564.

    Article  Google Scholar 

  34. Naldi M, Connectivity of Waxman topology models, Computer Communications, 2005, 29(1): 24–31.

    Article  Google Scholar 

  35. Barack Obama’s 2013 inaugural speech. 2013 [cited 20 November 2019]. Available from: http://noduslabs.com/cases/presidents-inaugural-speeches-text-network-analysis/.

  36. Zare M, Rezvani Z, and Benasich A A, Automatic classication of 6-month-old infants at familial risk for language-based learning disorder using a support vector machine, Clinical Neurophysiology, 2016, 127(7): 2695–2703.

    Article  Google Scholar 

  37. Kunegis J, KONECT: The Koblenz network collection, Proc. Int. Web Observatory Workshop, 2013, 1343–1350.

  38. Original website online: http://www-personal.umich.edu/mejn/netdata/.

  39. Estrada E, Quantifying network heterogeneity, Physical Review E, 2010, 82(6): 066102.

    Article  Google Scholar 

  40. Randi M, Characterization of molecular branching, J. Am. Chem. Soc., 1975, 97(23): 6609–6615.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science and Engineering, Shahid Beheshti University, Tehran, Iran

    Farshad Safaei

  2. School of Computer Science, Institute for Research in Fundamental Sciences, Tehran, Iran

    Amin Babaei

  3. Department of Computer Engineering, University of Torbat Heydarieh, Torbat Heydarieh, Iran

    Mehrnaz Moudi

Authors
  1. Farshad Safaei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amin Babaei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mehrnaz Moudi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Farshad Safaei, Amin Babaei or Mehrnaz Moudi.

Additional information

This paper was recommended for publication by Editor DI Zengru.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Safaei, F., Babaei, A. & Moudi, M. Optimally Connected Hybrid Complex Networks with Windmill Graphs Backbone. J Syst Sci Complex 33, 903–929 (2020). https://doi.org/10.1007/s11424-020-8294-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-020-8294-x

Keywords

Search

Navigation