Every property is testable on a natural class of scale-free multigraphs

In this paper, we introduce a natural class of multigraphs called hierarchical-scale-free (HSF) multigraphs, and consider constant-time testability on the class. We show that a very wide subclass, specifically, that in which the power-law exponent is greater than two, of HSF is hyperfinite. Based on this result, an algorithm for a deterministic partitioning oracle can be constructed. We conclude by showing that every property is constant-time testable on the above subclass of HSF. This algorithm utilizes findings by Newman and Sohler of STOC'11. However, their algorithm is based on the bounded-degree model, while it is known that actual scale-free networks usually include hubs, which have a very large degree. HSF is based on scale-free properties and includes such hubs. This is the first universal result of constant-time testability on the general graph model, and it has the potential to be applicable on a very wide range of scale-free networks.

[1]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[2]  Christian Sohler,et al.  Every property of hyperfinite graphs is testable , 2011, STOC '11.

[3]  Noga Alon,et al.  A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.

[4]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[5]  Gabor Elek,et al.  L2-spectral invariants and convergent sequences of finite graphs , 2007, 0709.1261.

[6]  Osamu Watanabe,et al.  A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques , 2011, J. Graph Algorithms Appl..

[7]  Jon Kleinberg,et al.  The Structure of the Web , 2001, Science.

[8]  RonDana,et al.  A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor , 2015 .

[9]  Oded Schramm,et al.  Every minor-closed property of sparse graphs is testable , 2008, Electron. Colloquium Comput. Complex..

[10]  Yuichi Yoshida,et al.  Testing Forest-Isomorphism in the Adjacency List Model , 2014, ICALP.

[11]  Krzysztof Onak,et al.  Local Graph Partitions for Approximation and Testing , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[12]  Yves Métivier,et al.  Some Remarks on the Kronecker Product of Graphs , 1998, Inf. Process. Lett..

[13]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[14]  Yong Gao.  The degree distribution of random k-trees , 2009, Theor. Comput. Sci..

[15]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[16]  Osamu Watanabe,et al.  A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques , 2010, J. Graph Algorithms Appl..

[17]  Kazuo Iwama,et al.  Enumeration of isolated cliques and pseudo-cliques , 2009, TALG.

[18]  Noga Alon,et al.  A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity , 2009 .

[19]  Mohammad Mahdian,et al.  Stochastic Kronecker Graphs , 2007, WAW.

[20]  Dana Ron,et al.  Approximating the distance to properties in bounded-degree and general sparse graphs , 2009, TALG.

[21]  Oded Goldreich,et al.  Property Testing - Current Research and Surveys , 2010, Property Testing.

[22]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 1997, STOC.

[23]  Krzysztof Onak,et al.  Planar Graphs: Random Walks and Bipartiteness Testing , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[24]  Lili Rong,et al.  High-dimensional random Apollonian networks , 2005, cond-mat/0502591.

[25]  Ryuhei Uehara,et al.  Scale Free Properties of Random k-Trees , 2010, Math. Comput. Sci..

[26]  Kazuo Iwama,et al.  Linear-Time Enumeration of Isolated Cliques , 2005, ESA.

[27]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[28]  Dana Ron,et al.  A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor , 2013, ICALP.