Physics – Condensed Matter – Disordered Systems and Neural Networks
Scientific paper
2007-01-10
Journal of Statistical Mechanics, P03006 (2007)
Physics
Condensed Matter
Disordered Systems and Neural Networks
16 pages, 14 figures
Scientific paper
10.1088/1742-5468/2007/03/P03006
Covering a network with the minimum possible number of boxes can reveal interesting features for the network structure, especially in terms of self-similar or fractal characteristics. Considerable attention has been recently devoted to this problem, with the finding that many real networks are self-similar fractals. Here we present, compare and study in detail a number of algorithms that we have used in previous papers towards this goal. We show that this problem can be mapped to the well-known graph coloring problem and then we simply can apply well-established algorithms. This seems to be the most efficient method, but we also present two other algorithms based on burning which provide a number of other benefits. We argue that the presented algorithms provide a solution close to optimal and that another algorithm that can significantly improve this result in an efficient way does not exist. We offer to anyone that finds such a method to cover his/her expenses for a 1-week trip to our lab in New York (details in http://jamlab.org).
Gallos Lazaros K.
Havlin Shlomo
Makse Hernan A.
Song Chaoming
No associations
LandOfFree
How to calculate the fractal dimension of a complex network: the box covering algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with How to calculate the fractal dimension of a complex network: the box covering algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How to calculate the fractal dimension of a complex network: the box covering algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-447648