Testing properties of signed graphs

02/15/2021
by   Florian Adriaens, et al.
0

In graph property testing the task is to distinguish whether a graph satisfies a given property or is "far" from having that property, preferably with a sublinear query and time complexity. In this work we initiate the study of property testing in signed graphs, where every edge has either a positive or a negative sign. We show that there exist sublinear algorithms for testing three key properties of signed graphs: balance (or 2-clusterability), clusterability and signed triangle freeness. We consider both the dense graph model, where we can query the (signed) adjacency matrix of a signed graph, and the bounded-degree model, where we can query for the neighbors of a node and the sign of the connecting edge. Our algorithms use a variety of tools from graph property testing, as well as reductions from one setting to the other. Our main technical contribution is a sublinear algorithm for testing clusterability in the bounded-degree model. This contrasts with the property of k-clusterability which is not testable with a sublinear number of queries. The tester builds on the seminal work of Goldreich and Ron for testing bipartiteness.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

11/29/2020

Erasure-Resilient Sublinear-Time Graph Algorithms

We investigate sublinear-time algorithms that take partially erased grap...
04/22/2019

Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs

Due to the massive size of modern network data, local algorithms that ru...
12/01/2021

Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing

A graph G is called self-ordered (a.k.a asymmetric) if the identity perm...
09/17/2021

Sublinear-Time Computation in the Presence of Online Erasures

We initiate the study of sublinear-time algorithms that access their inp...
12/05/2017

Approximating the Spectrum of a Graph

The spectrum of a network or graph G=(V,E) with adjacency matrix A, cons...
05/18/2021

GSF-locality is not sufficient for proximity-oblivious testing

In Property Testing, proximity-oblivious testers (POTs) form a class of ...
09/16/2020

Faster Property Testers in a Variation of the Bounded Degree Model

Property testing algorithms are highly efficient algorithms, that come w...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.