193
Views
7
CrossRef citations to date
0
Altmetric
Reviews

A Max–Min ant colony algorithm for fractal dimension of complex networks

, &
Pages 1927-1936 | Received 13 May 2015, Accepted 25 Jul 2017, Published online: 23 Aug 2017

References

  • V. Batagelj and A. Mrvar, Pajek datasets, 2011. Available at http://vlado.fmf.uni-lj.si/pub/networks/data/.
  • T.N. Behar, Analysis of fractal dimension of O2A glial cells differentiating in vitro, Methods 24(4) (2001), pp. 331–339. doi: 10.1006/meth.2001.1203
  • M. Bessedik, R. Laib, and A.B.H. Drias, Ant colony system for graph coloring problem, International Conference on Computational Intelligence for Modelling, Control and Automation, 2005 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce Vol. 1, IEEE, 2005, pp. 786–791.
  • N. Blagus, L. Šubelj, and M. Bajec, Self-similar scaling of density in complex real-world networks, Physica A Stat. Mech. Appl. 391(8) (2012), pp. 2794–2802. doi: 10.1016/j.physa.2011.12.055
  • D. Bu, Y. Zhao, and L. Cai, Topological structure analysis of the protein–protein interaction network in budding yeast, Nucleic Acids Res. 31(9) (2003), pp. 2443–2450. doi: 10.1093/nar/gkg340
  • F. Caserta, W.D. Eldred, E. Fernandez, R.E. Hausman, L.R. Stanford, S.V. Bulderev, S. Schwarzer, and H.E. Stanley, Determination of fractal dimension of physiologically characterized neurons in two and three dimensions, J. Neurosci. Methods 56(2) (1995), pp. 133–144. doi: 10.1016/0165-0270(94)00115-W
  • C. Cattani and G. Pierro. On the fractal geometry of DNA by the binary image analysis, Bull. Math. Biol. 75(9) (2013), pp. 1544–1570. doi: 10.1007/s11538-013-9859-9
  • A. Colorni, M. Dorigo, and V. Maniezzo, Distributed optimization by ant colonies, Proceedings of the First European Conference on Artificial Life Vol. 142, Paris, France, 1991, pp. 134–142.
  • F. Comellas, and J. Ozón, An ant algorithm for the graph colouring problem, Proceedings of the First International Workshop on Ant Colony Optimization, Brussels, Belgium, 1999, pp. 151–158.
  • A.L. Cruces, J.R. Rodríguez, D.E.H. González, and I.M. IGurrola, An ant colony algorithm for the robust graph coloring problem, ICGST AIML-11 Conference Vol. 12, Dubai, UAE, 2011, pp. 57–60.
  • D. Delignieres and V. Marmelat, Fractal fluctuations and complexity: Current debates and future challenges, Crit. Rev. Biomed. Eng. 40(6) (2012), pp. 485–500. doi: 10.1615/CritRevBiomedEng.2013006727
  • A. Di Ieva, F. Grizzi, H. Jelinek, A.J. Pellionisz, and G.A. Losa, Fractals in the neurosciences, Part I: general principles and basic neurosciences, Neuroscientist 20(4) (2014), pp. 403–417. doi: 10.1177/1073858413513927
  • M. Dorigo, and L.M. Gambardella, Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE Trans. Evolutionary Comput. 1(1) (1997), pp. 53–66. doi: 10.1109/4235.585892
  • J. Feder, Fractals, Plenum, New York, 1988.
  • L.K. Gallos, H.A. Makse, and M. Sigman, A small world of weak ties provides optimal global integration of self-similar modules in functional brain networks, Proc. Natl. Acad. Sci. 109(8) (2012), pp. 2825–2830. doi: 10.1073/pnas.1106612109
  • J.S. Kim, K.I. Goh, B. Kahng, and D. Kim, Fractality and self-similarity in scale-free networks, New J. Phys. 9(6) (2007), p. 177. doi: 10.1088/1367-2630/9/6/177
  • B.G. Li, Z.G. Yu, and Y. Zhou, Fractal and multifractal properties of a family of fractal networks, J. Stat. Mech. Theory Exp. 2014(2) (2014), p. P02020. doi: 10.1088/1742-5468/2014/02/P02020
  • H.A. Makse, The box-covering greedy algorithm, 2016. Available at http://www-levich.engr.ccny.cuny.edu/webpage/hmakse/software-and-data.
  • D.S. Mohamed and S. Elbernoussi, Max–Min ant system for the sum coloring problem, International Conference on Communications, Computing and Control Applications (CCCA), Hammamet, Tunisia, 2011, pp. 1–4.
  • H.O. Peitgen, H. Jürgens, and D. Saupe, Chaos and Fractals: New Frontiers of Science, Springer, Berlin, 2004.
  • P. Pellegrini, T. Stützle, and M. Birattari, Off-line vs. On-line Tuning: A Study onmathcal MAX—MIN Ant System for the TSP, Swarm Intelligence, Springer, Berlin Heidelberg, 2010, pp. 239–250.
  • E. Salari, and K. Eshghi, An ACO algorithm for graph coloring problem, 2005 ICSC Congress on Computational Intelligence Methods and Applications, IEEE, 2005, p. 5.
  • C.M. Schneider, T.A. Kesselring, J.S. Andrade Jr, and H.J. Herrmann, Box-covering algorithm for fractal dimension of complex networks, Phys. Rev. E 86(1) (2012), p. 016707. doi: 10.1103/PhysRevE.86.016707
  • C. Song, S. Havlin, and H.A. Makse, Self-similarity of complex networks, Nature 433(7024) (2005), pp. 392–395. doi: 10.1038/nature03248
  • C. Song, L.K. Gallos, S. Havlin, and H.A. Makse, How to calculate the fractal dimension of a complex network: The box covering algorithm, J. Stat. Mech. Theory Exp. 2007(3) (2007), p. P03006. doi: 10.1088/1742-5468/2007/03/P03006
  • T. Stützle, and H. Hoos, MAX–MIN ant system and local search for the traveling salesman problem, IEEE International Conference on Evolutionary Computation, IEEE, 1997, pp. 309–314.
  • T. Stützle, and H. Hoos, MAX–MIN ant system, Future Gener. Comput. Syst. 16(8) (2000), pp. 889–914. doi: 10.1016/S0167-739X(00)00043-1
  • Y. Sun, and Y. Zhao, Overlapping-box-covering method for the fractal dimension of complex networks, Phys. Rev. E 89(4) (2014), p. 042809. doi: 10.1103/PhysRevE.89.042809
  • D.J. Watts and S.H. Strogatz, Collective dynamics of ‘small-world’ networks, Nature 393(6684) (1998), pp. 440–442. doi: 10.1038/30918
  • D.-L. Wang, Z.-G. Yu, and V. Anh, Multifractal analysis of complex networks, Chin. Phys. B 21(8) (2012), p. 080504. doi: 10.1088/1674-1056/21/8/080504
  • J.G. White, E. Southgate, J.N. Thompson, and S. Brenner, The structure of the nervous system of the nematode C. elegans, Phil. Trans. R. Soc. 314 (1986), pp. 1–340. doi: 10.1098/rstb.1986.0056
  • L.-S. Zhang, W.-F. Gu, G. Hu, and Y.-Y. Mi, Network dynamics and its relationships to topology and coupling structure in excitable complex networks, Chin. Phys. B 23(10) (2014), p. 108902. doi: 10.1088/1674-1056/23/10/108902

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.