Hyperfiniteness of Real-World Networks

Yutaro Honda (), Yoshitaka Inoue (), Hiro Ito (), Munehiko Sasajima (), Junichi Teruyama () and Yushi Uno ()
Additional contact information
Yutaro Honda: Osaka Prefecture University
Yoshitaka Inoue: Osaka Prefecture University
Hiro Ito: The University of Electro-Communications
Munehiko Sasajima: University of Hyogo
Junichi Teruyama: University of Hyogo
Yushi Uno: Osaka Prefecture University

The Review of Socionetwork Strategies, 2019, vol. 13, issue 2, 123-141

Abstract: 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.

Keywords: Graph algorithms; Global partition; Property testing; Hyperfinite (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12626-019-00051-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:trosos:v:13:y:2019:i:2:d:10.1007_s12626-019-00051-3

Ordering information: This journal article can be ordered from
https://www.springer ... ystems/journal/12626

DOI: 10.1007/s12626-019-00051-3

Access Statistics for this article

The Review of Socionetwork Strategies is currently edited by Katsutoshi Yada, Yasuharu Ukai and Marshall Van Alstyne

More articles in The Review of Socionetwork Strategies from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().