Document Open Access Logo

The Discrepancy of Shortest Paths

Authors Greg Bodwin, Chengyuan Deng, Jie Gao , Gary Hoppenworth, Jalaj Upadhyay, Chen Wang

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2024.27.pdf
  • Filesize: 0.87 MB
  • 20 pages

Document Identifiers

Author Details

Greg Bodwin
  • Computer Science and Engineering, University of Michigan, Ann Arbor, MI, USA
Chengyuan Deng
  • Department of Computer Science, Rutgers University, Piscataway, NJ, USA
Jie Gao
  • Department of Computer Science, Rutgers University, Piscataway, NJ, USA
Gary Hoppenworth
  • Computer Science and Engineering, University of Michigan, Ann Arbor, MI, USA
Jalaj Upadhyay
  • Management Science and Information Systems, Rutgers University, Piscataway, NJ, USA
Chen Wang
  • Department of Computer Science, Rice University, Houston, TX, USA
  • Computer Science and Engineering, Texas A&M University, College Station, TX, USA

Funding

Greg Bodwin and Gary Hoppenworth: Supported by NSF:AF 2153680. Jie Gao and Chengyuan Deng: Supported partially by NSF DMS-2311064, DMS-2220271, IIS-2229876, CCF-2208663, CCF-2118953.
  • Upadhyay, Jalaj: Funded by Decanal Research Grant number 302918.

Cite As Get BibTex

Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, and Chen Wang. The Discrepancy of Shortest Paths. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 27:1-27:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.ICALP.2024.27

Abstract

The hereditary discrepancy of a set system is a quantitative measure of the pseudorandom properties of the system. Roughly speaking, hereditary discrepancy measures how well one can 2-color the elements of the system so that each set contains approximately the same number of elements of each color. Hereditary discrepancy has numerous applications in computational geometry, communication complexity and derandomization. More recently, the hereditary discrepancy of the set system of shortest paths has found applications in differential privacy [Chen et al. SODA 23].
The contribution of this paper is to improve the upper and lower bounds on the hereditary discrepancy of set systems of unique shortest paths in graphs. In particular, we show that any system of unique shortest paths in an undirected weighted graph has hereditary discrepancy O(n^{1/4}), and we construct lower bound examples demonstrating that this bound is tight up to polylog n factors. Our lower bounds hold even for planar graphs and bipartite graphs, and improve a previous lower bound of Ω(n^{1/6}) obtained by applying the trace bound of Chazelle and Lvov [SoCG'00] to a classical point-line system of Erdős.
As applications, we improve the lower bound on the additive error for differentially-private all pairs shortest distances from Ω(n^{1/6}) [Chen et al. SODA 23] to Ω̃(n^{1/4}), and we improve the lower bound on additive error for the differentially-private all sets range queries problem to Ω̃(n^{1/4}), which is tight up to polylog n factors [Deng et al. WADS 23].

Subject Classification

ACM Subject Classification
  • Theory of computation → Shortest paths
  • Theory of computation → Computational geometry
Keywords
  • Discrepancy
  • hereditary discrepancy
  • shortest paths
  • differential privacy

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Ittai Abraham, Amos Fiat, Andrew V Goldberg, and Renato F Werneck. Highway dimension, shortest paths, and provably efficient algorithms. In Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms, pages 782-793. SIAM, 2010. Google Scholar
  2. Shyan Akmal and Nicole Wein. A local-to-global theorem for congested shortest paths. In 31st Annual European Symposium on Algorithms (ESA 2023), pages 8:1-8:17, 2023. Google Scholar
  3. J Ralph Alexander, József Beck, and William WL Chen. Geometric discrepancy theory and uniform distribution. Handbook of discrete and computational geometry, page 279, 2004. Google Scholar
  4. Saeed Akhoondian Amiri and Julian Wargalla. Disjoint shortest paths with congestion on DAGs. arXiv preprint, 2020. URL: https://arxiv.org/abs/2008.08368.
  5. Lorenzo Balzotti. Non-crossing shortest paths are covered with exactly four forests. arXiv preprint, 2022. URL: https://arxiv.org/abs/2210.13036.
  6. Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F Werneck. Route planning in transportation networks. Algorithm engineering: Selected results and surveys, pages 19-80, 2016. Google Scholar
  7. Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, and Anna Zych-Pawlewicz. On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. In Holger Dell and Jesper Nederlof, editors, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), volume 249 of Leibniz International Proceedings in Informatics (LIPIcs), pages 5:1-5:23, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.IPEC.2022.5.
  8. Greg Bodwin. On the structure of unique shortest paths in graphs. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2071-2089. SIAM, 2019. Google Scholar
  9. Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, and Chen Wang. The discrepancy of shortest paths. arXiv preprint, 2024. URL: https://arxiv.org/abs/2401.15781.
  10. Greg Bodwin and Gary Hoppenworth. Folklore sampling is optimal for exact hopsets: Confirming the √n barrier. In Proceedings of the 64th IEEE Symposium on Foundations of Computer Science (FOCS) 2023, pages 701-720, 2023. Google Scholar
  11. Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, and Shay Solomon. Covering planar metrics (and beyond): O(1) trees suffice. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 2231-2261, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00139.
  12. Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, and Oren Weimann. Near-optimal distance emulator for planar graphs. In 26th Annual European Symposium on Algorithms (ESA 2018), pages 16:1-16:17, 2018. Google Scholar
  13. Hsien-Chih Chang, Robert Krauthgamer, and Zihan Tan. Near-linear ε-emulators for planar graphs. arXiv preprint, 2022. URL: https://arxiv.org/abs/2206.10681.
  14. Bernard Chazelle. The Discrepancy Method: Randomness and Complexity. Cambridge University Press, 2000. Google Scholar
  15. Bernard Chazelle and Alexey Lvov. A trace bound for the hereditary discrepancy. In Proceedings of the sixteenth annual symposium on Computational geometry, SCG '00, pages 64-69, New York, NY, USA, May 2000. Association for Computing Machinery. Google Scholar
  16. Justin Y. Chen, Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Shyam Narayanan, Jelani Nelson, and Yinzhan Xu. Differentially private all-pairs shortest path distances: Improved algorithms and lower bounds. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 5040-5067, 2023. Google Scholar
  17. Maria Chudnovsky, Daniel Cizma, and Nati Linial. The structure of metrizable graphs. arXiv preprint, 2023. URL: https://arxiv.org/abs/2311.09364.
  18. Fan R. K. Chung, Ronald L. Graham, and Richard M. Wilson. Quasi-random graphs. Combinatorica, 9:345-362, 1989. Google Scholar
  19. Daniel Cizma and Nati Linial. Geodesic geometry on graphs. Discrete & Computational Geometry, 68(1):298-347, 2022. Google Scholar
  20. Daniel Cizma and Nati Linial. Irreducible nonmetrizable path systems in graphs. Journal of Graph Theory, 102(1):5-14, 2023. Google Scholar
  21. Don Coppersmith and Michael Elkin. Sparse sourcewise and pairwise distance preservers. SIAM Journal on Discrete Mathematics, 20(2):463-501, 2006. Google Scholar
  22. Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. Introduction to algorithms. MIT press, 2022. Google Scholar
  23. Chengyuan Deng, Jie Gao, Jalaj Upadhyay, and Chen Wang. Differentially private range query on shortest paths. In Algorithms and Data Structures Symposium, pages 340-370. Springer, 2023. Google Scholar
  24. Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. Calibrating noise to sensitivity in private data analysis. In Proceedings of the Third Conference on Theory of Cryptography, pages 265-284. Springer, 2006. Google Scholar
  25. Cynthia Dwork and Aaron Roth. The algorithmic foundations of differential privacy. Foundations and Trendsregistered in Theoretical Computer Science, 9(3-4):211-407, 2014. Google Scholar
  26. Marek Eliáš, Michael Kapralov, Janardhan Kulkarni, and Yin Tat Lee. Differentially private release of synthetic graphs. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 560-578. SIAM, 2020. Google Scholar
  27. Chenglin Fan, Ping Li, and Xiaoyun Li. Private graph all-pairwise-shortest-path distance release with improved error rate. In Proceedings of Advances in Neural Information Processing Systems, volume 35, pages 17844-17856, 2022. Google Scholar
  28. Sariel Har-Peled. A simple proof of the existence of a planar separator. arXiv preprint, 2011. URL: https://arxiv.org/abs/1105.0103.
  29. Monika R Henzinger, Philip Klein, Satish Rao, and Sairam Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55(1):3-23, 1997. Google Scholar
  30. Shimon Kogan and Merav Parter. New diameter-reducing shortcuts and directed hopsets: Breaking the barrier. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1326-1341. SIAM, 2022. Google Scholar
  31. Kasper Green Larsen. Constructive discrepancy minimization with hereditary L2 guarantees. In Rolf Niedermeier and Christophe Paul, editors, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), volume 126 of Leibniz International Proceedings in Informatics (LIPIcs), pages 48:1-48:13, Dagstuhl, Germany, 2019. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Google Scholar
  32. Jingcheng Liu, Jalaj Upadhyay, and Zongrui Zou. Optimal bounds on private graph approximation. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1019-1049. SIAM, 2024. Google Scholar
  33. Jiři Matoušek. Geometric Discrepancy: An Illustrated Guide. Springer Science & Business Media, May 1999. Google Scholar
  34. Shanmugavelayutham Muthukrishnan and Aleksandar Nikolov. Optimal private halfspace counting via discrepancy. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing, pages 1285-1292, 2012. Google Scholar
  35. János Pach and Pankaj K Agarwal. Combinatorial Geometry. John Wiley & Sons, October 2011. Google Scholar
  36. Adam Sealfon. Shortest paths and distances with differential privacy. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 29-41, 2016. Google Scholar
  37. Csaba D Toth, Joseph O'Rourke, and Jacob E Goodman. Handbook of discrete and computational geometry. CRC Press, 2017. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact