Fractality of Massive Graphs: Scalable Analysis with Sketch-Based Box-Covering Algorithm
Fractality of Massive Graphs: Scalable Analysis with Sketch-Based Box-Covering Algorithm
Analysis and modeling of networked objects are fundamental pieces of modern data mining. Most real-world networks, from biological to social ones, are known to have common structural properties. These properties allow us to model the growth processes of networks and to develop useful algorithms. One remarkable example is the fractality …