Related Experiment Video
Updated: Mar 8, 2026

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
On the Fractality of Complex Networks: Covering Problem, Algorithms and Ahlfors Regularity
Lihong Wang1,2, Qin Wang3, Lifeng Xi2
1Faculty of Mechanical Engineering and Mechanics, Ningbo University, Ningbo 315211, P. R. China.
Abstract:
In this paper, we revisit the fractality of complex network by investigating three dimensions with respect to minimum box-covering, minimum ball-covering and average volume of balls. The first two dimensions are calculated through the minimum box-covering problem and minimum ball-covering problem. For minimum ball-covering problem, we prove its NP-completeness and propose several heuristic algorithms on its feasible solution, and we also compare the performance of these algorithms. For the third dimension, we introduce the random ball-volume algorithm. We introduce the notion of Ahlfors regularity of networks and prove that above three dimensions are the same if networks are Ahlfors regular. We also provide a class of networks satisfying Ahlfors regularity.
Related Concept Videos
Fundamental Theorem of Algebra
Limits with Oscillating Discontinuities
Stability of structures
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
SFG Algebra
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Indeterminate Forms and L’Hôpital’s Rule

