Open AccessCentre including eccentricity algorithm for complex networks
Author(s) -
Akhtanov S.,
Turlykozhayeva D.,
Ussipov N.,
Ibraimov M.,
Zhanabaev Z.
Publication year - 2022
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/ell2.12424
Subject(s) - fractal , eccentricity (behavior) , algorithm , node (physics) , fractal dimension , cover (algebra) , dimension (graph theory) , computer science , fractal dimension on networks , mathematics , topology (electrical circuits) , theoretical computer science , fractal analysis , discrete mathematics , combinatorics , physics , mathematical analysis , engineering , quantum mechanics , political science , law , mechanical engineering
In this work, the authors propose a new centre including eccentricity algorithm, to define the fractal dimension of networks. The authors did the fractal analysis of the real Escherichia coli network and a model UV‐flower network and confirmed that these networks are fractals . The fractal dimensions ( D $D$ ) of these networks are calculated and D $D$ = 2.485 for the real E. coli network and D $D$ = 2.1 for the UV‐flower network is obtained. Also, the authors defined the fractal dimensions of real social networks and compared their method with Song's, Zhang's and Zheng's methods. Furthermore, the authors’ algorithm can solve situations with single‐node boxes at the edges of the network and can cover networks with minimum number of boxes. The authors believe that centre including eccentricity algorithm is competitive among existing algorithms and can be used to evaluate fractal properties of complex networks.