Document

# Optimal Electrical Oblivious Routing on Expanders

## File

LIPIcs.ICALP.2024.65.pdf
• Filesize: 0.85 MB
• 19 pages

## Acknowledgements

We would like to thank Yang P. Liu for pointing us to the Riesz-Thorin theorem.

## Cite As

Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, and Sushant Sachdeva. Optimal Electrical Oblivious Routing on Expanders. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 65:1-65:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ICALP.2024.65

## Abstract

In this paper, we investigate the question of whether the electrical flow routing is a good oblivious routing scheme on an m-edge graph G = (V, E) that is a Φ-expander, i.e. where |∂ S| ≥ Φ ⋅ vol(S) for every S ⊆ V, vol(S) ≤ vol(V)/2. Beyond its simplicity and structural importance, this question is well-motivated by the current state-of-the-art of fast algorithms for 𝓁_∞ oblivious routings that reduce to the expander-case which is in turn solved by electrical flow routing. Our main result proves that the electrical routing is an O(Φ^{-1} log m)-competitive oblivious routing in the 𝓁₁- and 𝓁_∞-norms. We further observe that the oblivious routing is O(log² m)-competitive in the 𝓁₂-norm and, in fact, O(log m)-competitive if 𝓁₂-localization is O(log m) which is widely believed. Using these three upper bounds, we can smoothly interpolate to obtain upper bounds for every p ∈ [2, ∞] and q given by 1/p + 1/q = 1. Assuming 𝓁₂-localization in O(log m), we obtain that in 𝓁_p and 𝓁_q, the electrical oblivious routing is O(Φ^{-(1-2/p)}log m) competitive. Using the currently known result for 𝓁₂-localization, this ratio deteriorates by at most a sublogarithmic factor for every p, q ≠ 2. We complement our upper bounds with lower bounds that show that the electrical routing for any such p and q is Ω(Φ^{-(1-2/p)} log m)-competitive. This renders our results in 𝓁₁ and 𝓁_∞ unconditionally tight up to constants, and the result in any 𝓁_p- and 𝓁_q-norm to be tight in case of 𝓁₂-localization in O(log m).

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Routing and network design problems
##### Keywords
• Expanders
• Oblivious routing for 𝓁_p
• Electrical flow routing

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. N Alon and V. D Milman. Λ1, Isoperimetric inequalities for graphs, and superconcentrators. Journal of Combinatorial Theory, Series B, 38(1):73-88, February 1985. URL: https://doi.org/10.101 6/0095-8956(85)90092-9.
2. Noga Alon, Shirshendu Ganguly, and Nikhil Srivastava. High-girth near-ramanujan graphs with localized eigenvectors. Israel Journal of Mathematics, 246(1):1-20, 2021.
3. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, and Harald Racke. Optimal oblivious routing in polynomial time. In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pages 383-388, 2003.
4. Yair Bartal and Stefano Leonardi. On-line routing in all-optical networks. In Pierpaolo Degano, Roberto Gorrieri, and Alberto Marchetti-Spaccamela, editors, Automata, Languages and Programming, Lecture Notes in Computer Science, pages 516-526, Berlin, Heidelberg, 1997. Springer. URL: https://doi.org/10.1007/3-540-63165-8_207.
5. Jeff Cheeger. A lower bound for the smallest eigenvalue of the Laplacian, Problems in analysis (Papers dedicated to Salomon Bochner, 1969), 1970.
6. Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, and Maximilian Probst Gutenberg. Almost-linear time algorithms for incremental graphs: Cycle detection, sccs, s-t shortest path, and minimum-cost flow. CoRR, abs/2311.18295, 2023. To appear at STOC'24. URL: https://doi.org/10.48550/arXiv.2311.18295.
7. Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, and Sushant Sachdeva. Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pages 612-623, October 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00064.
8. Michael B Cohen, Rasmus Kyng, Gary L Miller, Jakub W Pachocki, Richard Peng, Anup B Rao, and Shen Chen Xu. Solving sdd linear systems in nearly m log1/2 n time. In Proceedings of the forty-sixth annual ACM symposium on Theory of computing, pages 343-352, 2014.
9. Matthias Englert and Harald Räcke. Oblivious routing for the Lp-norm. In 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pages 32-40. IEEE, 2009.
10. Mohsen Ghaffari, Bernhard Haeupler, and Goran Zuzic. Hop-constrained oblivious routing. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, pages 1208-1220, New York, NY, USA, June 2021. Association for Computing Machinery. URL: https://doi.org/10.1145/3406325.3451098.
11. Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, and A. R. Sricharan. Electrical flows for polylogarithmic competitive oblivious routing, 2023. URL: https://arxiv.org/abs/2303.02491.
12. Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, and Zihan Tan. The expander hierarchy and its applications to dynamic graph algorithms. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2212-2228. SIAM, 2021.
13. Bernhard Haeupler, Harald Räcke, and Mohsen Ghaffari. Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, pages 1325-1338, New York, NY, USA, June 2022. Association for Computing Machinery. URL: https://doi.org/10.1145/3519935.3520026.
14. Arun Jambulapati and Aaron Sidford. Ultrasparse ultrasparsifiers and faster laplacian system solvers. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 540-559. SIAM, 2021.
15. Jonathan Kelner and Petar Maymounkov. Electric routing and concurrent flow cutting. Theoretical computer science, 412(32):4123-4135, 2011.
16. Jonathan A. Kelner, Yin Tat Lee, Lorenzo Orecchia, and Aaron Sidford. An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations, 2013. URL: https://arxiv.org/abs/1304.2338.
17. Jonathan A Kelner, Lorenzo Orecchia, Aaron Sidford, and Zeyuan Allen Zhu. A simple, combinatorial algorithm for solving sdd systems in nearly-linear time. In Proceedings of the forty-fifth annual ACM symposium on Theory of computing, pages 911-920, 2013.
18. Rasmus Kyng, Richard Peng, Sushant Sachdeva, and Di Wang. Flows in almost linear time via adaptive preconditioning. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 902-913, 2019.
19. Rasmus Kyng and Maximilian Probst. Advanced graph algorithms and optimization, 2021.
20. Rasmus Kyng and Sushant Sachdeva. Approximate gaussian elimination for laplacians-fast, sparse, and simple. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pages 573-582. IEEE, 2016.
21. Gregory Lawler and Hariharan Narayanan. Mixing times and 𝓁_p bounds for oblivious routing. In 2009 Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pages 66-74. SIAM, 2009.
22. Huan Li and Aaron Schild. Spectral subspace sparsification. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pages 385-396. IEEE, 2018.
23. Jason Li. Faster parallel algorithm for approximate shortest path. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pages 308-321, 2020.
24. Aleksander Madry. Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs. In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pages 245-254, October 2010. URL: https://doi.org/10.1109/FOCS.2010.30.
25. B.M. Maggs, F. Meyer auf der Heide, B. Vocking, and M. Westermann. Exploiting locality for data management in systems of limited bandwidth. In Proceedings 38th Annual Symposium on Foundations of Computer Science, pages 284-293, October 1997. URL: https://doi.org/10.1109/SFCS.1997.646117.
26. Richard Peng. Approximate undirected maximum flows in o (m polylog (n)) time. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1862-1867. SIAM, 2016.
27. H. Racke. Minimizing congestion in general networks. In The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pages 43-52, November 2002. URL: https://doi.org/10.1109/SFCS.2002.1181881.
28. Harald Räcke. Optimal hierarchical decompositions for congestion minimization in networks. In Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pages 255-264, 2008.
29. Harald Räcke, Chintan Shah, and Hanjo Täubig. Computing Cut-Based Hierarchical Decompositions in Almost Linear Time. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 227-238. Society for Industrial and Applied Mathematics, January 2014. URL: https://doi.org/10.1137/1.9781611973402.17.
30. Václav Rozhoň, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, and Jason Li. Undirected (1+ ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 478-487, 2022.
31. Aaron Schild. An almost-linear time algorithm for uniform random spanning tree generation. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pages 214-227, 2018.
32. Aaron Schild, Satish Rao, and Nikhil Srivastava. Localization of electrical flows. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '18, pages 1577-1584, USA, January 2018. Society for Industrial and Applied Mathematics.
33. Jonah Sherman. Nearly maximum flows in nearly linear time. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pages 263-269. IEEE, 2013.
34. Jonah Sherman. Generalized preconditioning and undirected minimum-cost flow. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 772-780. SIAM, 2017.
35. Daniel A. Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, STOC '04, pages 81-90, New York, NY, USA, June 2004. Association for Computing Machinery. URL: https://doi.org/10.1145/1007352.1007372.
36. Elias M. Stein and Guido Weiss. The Fourier Transform, pages 1-36. Princeton University Press, 1971. URL: http://www.jstor.org/stable/j.ctt1bpm9w6.4.
37. L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, STOC '81, pages 263-277, New York, NY, USA, 1981. Association for Computing Machinery. URL: https://doi.org/10.1145/800076.802479.
38. Leslie G. Valiant. A scheme for fast parallel communication. SIAM journal on computing, 11(2):350-361, 1982.
39. Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, and Xiaorui Sun. Universally-optimal distributed shortest paths and transshipment via graph-based l_1-oblivious routing. In Joseph (Seffi) Naor and Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pages 2549-2579. SIAM, 2022. URL: https://doi.org/10.1137/1.9781611977073.100.