A discrete particle swarm optimization box-covering algorithm for fractal dimension on complex networks

Researchers have widely investigated the fractal property of complex networks, in which the fractal dimension is normally evaluated by box-covering method. The crux of box-covering method is to find the solution with minimum number of boxes to tile the whole network. Here, we introduce a particle swarm optimization box-covering (PSOBC) algorithm based on discrete framework. Compared with our former algorithm, the new algorithm can map the search space from continuous to discrete one, and reduce the time complexity significantly. Moreover, because many real-world networks are weighted networks, we also extend our approach to weighted networks, which makes the algorithm more useful on practice. Experiment results on multiple benchmark networks compared with state-of-the-art algorithms show that this PSOBC algorithm is effective and promising on various network structures.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  B. Mandelbrot.  How Long Is the Coast of Britain? Statistical Self-Similarity and Fractional Dimension , 1967, Science.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[5]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[6]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[7]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[8]  B. Mandelbrot.  How Long Is the Coast of Britain ? , 2002 .

[9]  Imtiaz Ahmad,et al.  Particle swarm optimization for task assignment problem , 2002, Microprocess. Microsystems.

[10]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[11]  S. Havlin,et al.  Self-similarity of complex networks , 2005, Nature.

[12]  K-I Goh,et al.  Skeleton and fractal scaling in complex networks. , 2006, Physical review letters.

[13]  Shlomo Havlin,et al.  Origins of fractality in the growth of complex networks , 2005, cond-mat/0507216.

[14]  D. Y. Sha,et al.  A hybrid particle swarm optimization for job shop scheduling problem , 2006, Comput. Ind. Eng..

[15]  S. Havlin,et al.  How to calculate the fractal dimension of a complex network: the box covering algorithm , 2007, cond-mat/0701216.

[16]  D. Sornette,et al.  Exploring self-similarity of complex cellular networks: The edge-covering method with simulated annealing and log-periodic sampling , 2006, cond-mat/0605676.

[17]  K. Goh,et al.  Fractality and self-similarity in scale-free networks , 2007 .

[18]  S. Havlin,et al.  Scaling theory of transport in complex biological networks , 2007, Proceedings of the National Academy of Sciences.

[19]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[20]  Mario Locci,et al.  Three algorithms for analyzing fractal software networks , 2010 .

[21]  Hernán A Makse,et al.  Small-world to fractal transition in complex networks: a renormalization group approach. , 2009, Physical review letters.

[22]  T. Carletti,et al.  Weighted Fractal Networks , 2009, Physica A: Statistical Mechanics and its Applications.

[23]  T. Bendib,et al.  Electrical Performance Optimization of Nanoscale Double-Gate MOSFETs Using Multiobjective Genetic Algorithms , 2011, IEEE Transactions on Electron Devices.

[24]  Mariano Sigman,et al.  A small world of weak ties provides optimal global integration of self-similar modules in functional brain networks , 2011, Proceedings of the National Academy of Sciences.

[25]  Hans J. Herrmann,et al.  Optimal box-covering algorithm for fractal dimension of complex networks , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  N. Lakhdar,et al.  An improved analog electrical performance of submicron Dual-Material gate (DM) GaAs-MESFETs using multi-objective computation , 2013 .

[27]  Sankaran Mahadevan,et al.  Box-covering algorithm for fractal dimension of weighted networks , 2013, Scientific Reports.

[28]  Yuanyuan Sun,et al.  Overlapping-box-covering method for the fractal dimension of complex networks. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Maoguo Gong,et al.  Complex Network Clustering by Multiobjective Discrete Particle Swarm Optimization Based on Decomposition , 2014, IEEE Transactions on Evolutionary Computation.

[30]  Fei Yu,et al.  A differential evolution box-covering algorithm for fractal dimension on complex networks , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[31]  Yu Sun,et al.  A fractal and scale-free model of complex networks with hub attraction behaviors , 2013, Science China Information Sciences.