Upper Bound of Relative Error of Random Ball Coverage for Calculating Fractal Network Dimension

Details Upper Bound of Relative Error of Random Ball Coverage for Calculating Fractal Network Dimension Upper Bound of Relative Error of Random Ball Coverage for Calculating Fractal Network Dimension

2007-10-27

arxiv.org/abs/0710.5228v2

Physics

Condensed Matter

Statistical Mechanics

6 pages, 1 figure

Scientific paper

Least box number coverage problem for calculating dimension of fractal networks is a NP-hard problem. Meanwhile, the time complexity of random ball coverage for calculating dimension is very low. In this paper we strictly present the upper bound of relative error for random ball coverage algorithm. We also propose twice-random ball coverage algorithm for calculating network dimension. For many real-world fractal networks, when the network diameter is sufficient large, the relative error upper bound of this method will tend to 0. In this point of view, given a proper acceptable error range, the dimension calculation is not a NP-hard problem, but P problem instead.

Affiliated with

Also associated with

No associations

Rating

Upper Bound of Relative Error of Random Ball Coverage for Calculating Fractal Network Dimension 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 Upper Bound of Relative Error of Random Ball Coverage for Calculating Fractal Network Dimension, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Upper Bound of Relative Error of Random Ball Coverage for Calculating Fractal Network Dimension will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-469028