Randomized Communication and the Implicit Graph Conjecture

11/05/2021
by   Nathaniel Harms, et al.
0

The most basic lower-bound question in randomized communication complexity is: Does a given problem have constant cost, or non-constant cost? We observe that this question has a deep connection to the Implicit Graph Conjecture (IGC) in structural graph theory. Specifically, constant-cost communication problems correspond to a certain subset of hereditary graph families that satisfy the IGC: those that admit constant-size probabilistic universal graphs (PUGs), or, equivalently, those that admit constant-size adjacency sketches. We initiate the study of the hereditary graph families that admit constant-size PUGs, with the two (equivalent) goals of (1) giving a structural characterization of randomized constant-cost communication problems, and (2) resolving a probabilistic version of the IGC. For each family ℱ studied in this paper (including the monogenic bipartite families, product graphs, interval and permutation graphs, families of bounded twin-width, and others), it holds that the subfamilies ℋ⊆ℱ are either stable (in a sense relating to model theory), in which case they admit constant-size PUGs (i.e. adjacency sketches), or they are not stable, in which case they do not. We conjecture that this always holds, i.e. that constant-cost randomized communication problems correspond to the set of stable families that satisfy the IGC. As a consequence of our results, we also obtain constant-size adjacency sketches, and an O(log n) adjacency labeling scheme, for the induced subgraphs of arbitrary Cartesian products, as well as constant-size small-distance sketches for Cartesian products and stable families of bounded twin-width (including planar graphs, answering a question from earlier work).

READ FULL TEXT

page 5

page 8

page 40

research
11/19/2021

A counter-example to the probabilistic universal graph conjecture via randomized communication complexity

We refute the Probabilistic Universal Graph Conjecture of Harms, Wild, a...
research
11/09/2019

Universal Communication, Universal Graphs, and Graph Labeling

We introduce a communication model called universal SMP, in which Alice ...
research
09/07/2023

Adjacency Sketches in Adversarial Environments

An adjacency sketching or implicit labeling scheme for a family F of gra...
research
06/06/2022

Optimal Adjacency Labels for Subgraphs of Cartesian Products

For any hereditary graph class ℱ, we construct optimal adjacency labelin...
research
07/10/2023

Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank

We prove a characterization of the structural conditions on matrices of ...
research
07/20/2023

Small But Unwieldy

We show that for any natural number s, there is a constant γ and a subgr...
research
02/18/2022

Sketching Distances in Monotone Graph Classes

We study the problems of adjacency sketching, small-distance sketching, ...

Please sign up or login with your details

Forgot password? Click here to reset