Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs

Talya Eden, Dana Ron, Will Rosenbaum

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Counting and sampling small subgraphs are fundamental algorithmic tasks. Motivated by the need to handle massive datasets efficiently, recent theoretical work has examined the problems in the sublinear time regime. In this work, we consider the problem of sampling a k-clique in a graph from an almost uniform distribution. Specifically the algorithm should output each k-clique with probability (1 ± ϵ)/nk, where nk denotes the number of k-cliques in the graph and ϵ is a given approximation parameter. To this end, the algorithm may perform degree, neighbor, and pair queries. We focus on the class of graphs with arboricity at most α, and prove that the query complexity of the problem is (Equation presented) where n is the number of vertices in the graph, and Θ(·) suppresses dependencies on (log n/ϵ)O(k). Our upper bound is based on defining a special auxiliary graph Hk, such that sampling edges almost uniformly in Hk translates to sampling k-cliques almost uniformly in the original graph G. We then build on a known edge-sampling algorithm (Eden, Ron and Rosenbaum, ICALP19) to sample edges in Hk. The challenge is simulating queries to Hk while being given query access only to G. Our lower bound follows from a construction of a family of graphs with arboricity α such that in each graph there are nk k-cliques, where one of these cliques is “hidden” and hence hard to sample.

Original languageEnglish
Title of host publication49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022
EditorsMikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772358
DOIs
StatePublished - 1 Jul 2022
Event49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022 - Paris, France
Duration: 4 Jul 20228 Jul 2022

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume229
ISSN (Print)1868-8969

Conference

Conference49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022
Country/TerritoryFrance
CityParis
Period4/07/228/07/22

Keywords

  • arboricity
  • cliques
  • graph algorithms
  • sublinear time algorithms
  • uniform sampling

Fingerprint

Dive into the research topics of 'Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs'. Together they form a unique fingerprint.

Cite this