Papers
Topics
Authors
Recent
Search
2000 character limit reached

Low Sensitivity Hopsets

Published 14 Jul 2024 in cs.DS | (2407.10249v1)

Abstract: Given a weighted graph GG, a (β,ε)(\beta,\varepsilon)-hopset HH is an edge set such that for any s,t∈V(G)s,t \in V(G), where ss can reach tt in GG, there is a path from ss to tt in G∪HG \cup H which uses at most β\beta hops whose length is in the range [distG(s,t),(1+ε)distG(s,t)][dist_G(s,t), (1+\varepsilon)dist_G(s,t)]. We break away from the traditional question that asks for a hopset that achieves small ∣H∣|H| and instead study its sensitivity, a new quality measure which, informally, is the maximum number of times a vertex (or edge) is bypassed by an edge in HH. The highlights of our results are: (i) (O~(n),0)(\widetilde{O}(\sqrt{n}),0)-hopsets on undirected graphs with O(log⁡n)O(\log n) sensitivity, complemented with a lower bound showing that O~(n)\widetilde{O}(\sqrt{n}) is tight up to polylogarithmic factors for any construction with polylogarithmic sensitivity. (ii) (no(1),ε)(n^{o(1)},\varepsilon)-hopsets on undirected graphs with no(1)n^{o(1)} sensitivity for any ε>0\varepsilon > 0 that is at least inverse polylogarithmic, complemented with a lower bound on the tradeoff between β,ε\beta, \varepsilon, and the sensitivity. (iii) O~(n)\widetilde{O}(\sqrt{n})-shortcut sets on directed graphs with O(log⁡n)O(\log n) sensitivity, complemented with a lower bound showing that β=Ω~(n1/3)\beta = \widetilde{\Omega}(n^{1/3}) for any construction with polylogarithmic sensitivity. We believe hopset sensitivity is a natural measure in and of itself, and could potentially find use in a diverse range of contexts. More concretely, the notion of hopset sensitivity is also directly motivated by the Differentially Private All Sets Range Queries problem. Our result for O(log⁡n)O(\log n) sensitivity (O~(n),0)(\widetilde{O}(\sqrt{n}),0)-hopsets on undirected graphs immediately improves the current best-known upper bound on utility from O~(n1/3)\widetilde{O}(n^{1/3}) to O~(n1/4)\widetilde{O}(n^{1/4}) in the pure-DP setting, which is tight up to polylogarithmic factors.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.