This document proposes a sketch-based box-covering algorithm to efficiently analyze the fractality of massive graphs. It summarizes that some real-world networks have been found to be fractal in nature, but existing algorithms for determining fractality are too slow for large networks. The proposed method uses min-hash to represent boxes implicitly and solves the box-covering problem efficiently i
![Lambda and rundeck](https://cdn-ak-scissors.b.st-hatena.com/image/square/1eb6740c6103bd7c38843785c4bb704ab5add18d/height=288;version=1;width=512/https%3A%2F%2Fcdn.slidesharecdn.com%2Fss_thumbnails%2Flambdaandrundeck-160301023848-thumbnail.jpg%3Fwidth%3D640%26height%3D640%26fit%3Dbounds)