Aarhus University Seal

Disjointness through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  • Anup Bhattacharya, NISER
  • ,
  • Sourav Chakraborty, Indian Statistical Institute
  • ,
  • Arijit Ghosh, Indian Statistical Institute
  • ,
  • Gopinath Mishra, University of Warwick
  • ,
  • Manaswi Paraashar

The disjointness problem—where Alice and Bob are given twosubsets of { 1 , ⋯ , n} and they have to check if their setsintersect—is a central problem in the world of communicationcomplexity. While both deterministic and randomized communicationcomplexities for this problem are known to be Θ (n) , it isalso known that if the sets are assumed to be drawn from somerestricted set systems then the communication complexity can be muchlower. In this work, we explore how communication complexitymeasures change with respect to the complexity of the underlying setsystem. The complexity measure for the set system that we use inthis work is the Vapnik—Chervonenkis (VC) dimension. Moreprecisely, on any set system with VC dimension bounded by d, weanalyze how large can the deterministic and randomized communicationcomplexities be, as a function of d and n. The d-sparse setdisjointness problem, where the sets have size at most d, is onesuch set system with VC dimension d. The deterministic and therandomized communication complexities of the d-sparse setdisjointness problem have been well studied and are known to beΘ (dlog (n/ d)) and Θ (d) ,respectively, in the multi-round communication setting. In thispaper, we address the question of whether the randomizedcommunication complexity of the disjointness problem is always upperbounded by a function of the VC dimension of the set system, anddoes there always exist a gap between the deterministic andrandomized communication complexities of the disjointness problemfor set systems with small VC dimension. We construct two natural set systems of VC dimension d, motivated from geometry. Using these set systems, we show that the deterministic and randomized communication complexity can be Θ ~ (dlog (n/ d)) for set systems of VC dimension d and this matches the deterministic upper bound for all set systems of VC dimension d. We also study the deterministic and randomized communication complexities of the set intersection problem when sets belong to a set system of bounded VC dimension. We show that there exist set systems of VC dimension d such that both deterministic and randomized (one-way and multi-round) complexities for the set intersection problem can be as high as Θ (dlog (n/ d)).

Original languageEnglish
Article number9
JournalComputational Complexity
Number of pages31
Publication statusPublished - Dec 2022

Bibliographical note

Publisher Copyright:
© 2022, Crown.

    Research areas

  • 52C35, 94A05, Communication complexity, Geometric Set System, Sparsity, VC dimension

See relations at Aarhus University Citationformats

ID: 274789214