Hyperfiniteness of Real-World Networks
- 32 Downloads
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.
KeywordsGraph algorithms Global partition Property testing Hyperfinite
This work was partially supported by JST CREST JPMJR1402.
- 1.Albert, R., & Barabási, A. L. (2002). Statistical mechanics of complex networks. Rev. Mod. Phys., 74, 47–97.Google Scholar
- 4.Alon, N., Seymour, P., & Thomas, R. (1990). A separator theorem for graphs with an excluded minor and its applications. In: Proceedings of the twenty-second annual ACM symposium on theory of computing (STOC), pp. 293–299.Google Scholar
- 5.Benjamini, I., Schramm, O., & Shapira, A. (2008). Every minor-closed property of sparse graphs is testable. In: Proceedings of the fortieth annual ACM symposium on theory of computing (STOC), pp. 393–402.Google Scholar
- 7.Cohen-Steiner, D., Kong, W., Sohler, C., & Valiant, G. (2018). Approximating the spectrum of a graph. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, KDD ’18, pp. 1263–1271. ACM, New York, NY, USA. https://doi.org/10.1145/3219819.3220119.
- 8.Czumaj, A., Monemizadeh, M., Onak, K., & Sohler, C. (2011). Planar graphs: random walks and bipartiteness testing. In: IEEE 52nd annual symposium on foundations of computer science (FOCS), pp. 423–432.Google Scholar
- 10.Goldreich, O. (Ed.). (2010). Property testing: current research and surveys. Lecture notes in computer science (Vol. 6390). Berlin: Springer.Google Scholar
- 13.Goldreich, O., & Ron, D. (1997). Property testing in bounded degree graphs. In: Proceedings of the twenty-ninth annual ACM symposium on theory of computing (STOC), pp. 406–415. ACM.Google Scholar
- 14.Hassidim, A., Kelner, J.A., Nguyen, H.N., & Onak, K. (2009). Local graph partitions for approximation and testing. In: 50th annual IEEE symposium on foundations of computer science (FOCS), pp. 22–31.Google Scholar
- 15.Ito, H. (2016). Every property is testable on a natural class of scale-free multigraphs. In: P. Sankowski, C. Zaroliagis (eds.) 24th annual European symposium on algorithms (ESA), Leibniz International Proceedings in Informatics (LIPIcs), vol. 57, pp. 51:1–51:12.Google Scholar
- 18.Lipton, R.J., & Tarjan, R.E. (1977). Applications of a planar separator theorem. In: Foundations of computer science, 1977., 18th annual symposium on, pp. 162–170. IEEE.Google Scholar
- 20.Newman, I., & Sohler, C. (2011). Every property of hyperfinite graphs is testable. In: Proceedings of the forty-third annual ACM symposium on theory of computing (STOC), pp. 675–684.Google Scholar
- 21.Sanders, P., & Schulz, C. (2013). Think Locally, Act Globally: Highly Balanced Graph Partitioning. In: Proceedings of the 12th International Symposium on Experimental Algorithms (SEA’13), LNCS, vol. 7933, pp. 164–175. SpringerGoogle Scholar