Hyperfiniteness of Real-World Networks

Abstract

In addition to being rich material for successful deep learning, recent rapidly exploding big data needs more sophisticated direct approaches such algorithms that are expected to run in sublinear or even constant time. In view of this situation, property testing, which has been extensively studied in recent theoretical computer science areas, has become a promising approach. The basic framework of property testing is to decide with some inaccuracy if the input data have a certain property or not by reading only some fraction of the input. Especially, for the property testing of graphs, the hyperfiniteness of graphs plays an important role, which guarantees that any graph property can be testable. This hyperfiniteness requires graphs to have a partition that satisfies some conditions, and a property testing on algorithms that are run on those partitioned graphs. In this paper, we try to obtain such ideal partitions that satisfy hyperfiniteness by implementing an efficient partition algorithm recently proposed by Levi and Ron [ACM TALG, 2015]. Our experiments are performed mainly on real-world networks with the aim of bringing the theoretical results of property testing into practical use for big data analyses. As a result, we observed what would be effective for some classes of networks, which suggests great prospects of property testing in practice.