Document

# Distributed Sparse Cut Approximation

## File

LIPIcs.OPODIS.2015.10.pdf
• Filesize: 1.02 MB
• 14 pages

## Cite As

Fabian Kuhn and Anisur Rahaman Molla. Distributed Sparse Cut Approximation. In 19th International Conference on Principles of Distributed Systems (OPODIS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 46, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.OPODIS.2015.10

## Abstract

We study the problem of computing a sparse cut in an undirected network graph G=(V,E). We measure the sparsity of a cut (S,V\S) by its conductance phi(S), i.e., by the ratio of the number of edges crossing the cut and the sum of the degrees on the smaller of the two sides. We present an efficient distributed algorithm to compute a cut of low conductance. Specifically, given two parameters b and phi, if there exists a cut of balance at least b and conductance at most phi, our algorithm outputs a cut of balance at least b/2 and conductance at most ~O(sqrt{phi}), where ~O(.) hides polylogarithmic factors in the number of nodes n. Our distributed algorithm works in the \congest model, i.e., it only requires to send messages of size at most O(log(n)) bits. The time complexity of the algorithm is ~O(D + 1/b*phi), where D is the diameter of G. This is a significant improvement over a result by Das Sarma et al. [ICDCN 2015], where it is shown that a cut of the same quality can be computed in time ~O(n + 1/b*phi). The improved running time is in particular achieved by devising and applying an efficient distributed algorithm for the all-prefix-sums problem in a distributed search tree. This algorithm, which is based on the classic parallel all-prefix-sums algorithm, might be of independent interest.
##### Keywords
• sparsest cut
• conductance
• random walks
• all-prefix-sums

## Metrics

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

## References

1. Reid Andersen, Fan R. K. Chung, and Kevin J. Lang. Using pagerank to locally partition a graph. Internet Mathematics, 4(1):35-64, 2007.
2. Reid Andersen and Yuval Peres. Finding sparse cuts locally using evolving sets. In Proc. of 41st Annual ACM Symposium on Theory of Computing (STOC), pages 235-244, 2009.
3. Sanjeev Arora and Satyen Kale. A combinatorial, primal-dual approach to semidefinite programs. In Proc. of 39th Annual ACM Symposium on Theory of Computing (STOC), pages 227-236, 2007.
4. Sanjeev Arora, Satish Rao, and Umesh V. Vazirani. Expander flows, geometric embeddings and graph partitioning. J. ACM, 56(2), 2009.
5. Sandeep N. Bhatt and Frank T. Leighton. A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci., 28(2):300-343, 1984.
6. Guy E. Blelloch. Prefix sums and their applications. Technical Report CMU-CS-90-190, School of Computer Science, Carnegie Mellon University, 1990.
7. Keren Censor-Hillel and Hadas Shachnai. Fast information spreading in graphs with large weak conductance. SIAM J. Comput., 41(6):1451-1465, 2012.
8. Flavio Chierichetti, Silvio Lattanzi, and Alessandro Panconesi. Almost tight bounds for rumour spreading with conductance. In Proc. of the 42nd ACM Symposium on Theory of Computing (STOC), pages 399-408, 2010.
9. Atish Das Sarma, Sreenivas Gollapudi, and Rina Panigrahy. Sparse cut projections in graph streams. In Proc. of 17th Annual European Symposium (ESA), pages 480-491, 2009.
10. Atish Das Sarma, Anisur R. Molla, and Gopal Pandurangan. Distributed computation of sparse cuts via random walks. In Proc. of 16th International Conference on Distributed Computing and Networking (ICDCN), pages 6:1-6:10, 2015.
11. Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, and Prasad Tetali. Distributed random walks. J. ACM, 60(1):2, 2013.
12. George Giakkoupis. Tight bounds for rumor spreading in graphs of a given conductance. In Proc. Int. Symp. on Theoretical Aspects of Computer Science (STACS), pages 57-68, 2011.
13. Christos Gkantsidis, Milena Mihail, and Amin Saberi. Conductance and congestion in power-law graphs. In Proc. of International Conference on Measurements and Modeling of Computer Systems (SIGMETRICS), pages 148-159, 2003.
14. Mark Jerrum and Alistair Sinclair. Approximating the permanent. SIAM J. Comput., 18(6):1149-1178, 1989.
15. David R. Karger. Minimum cuts in near-linear time. J. ACM, 47(1):46-76, 2000.
16. Peter M. Kogge and Harold S. Stone. A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Transactions on Computers, C-22(8):786-793, 1973.
17. Richard E. Ladner and Michael J. Fischer. Parallel prefix computation. J. ACM, 27(4):831-838, 1980.
18. Frank T. Leighton and Satish Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787-832, 1999.
19. László Lovász and Miklós Simonovits. The mixing rate of markov chains, an isoperimetric inequality, and computing the volume. In Proc. of 31st Annual Symposium on Foundations of Computer Science (FOCS), pages 346-354, 1990.
20. László Lovász and Miklós Simonovits. Random walks in a convex body and an improved volume algorithm. Random Struct. Algorithms, 4(4):359-412, 1993.
21. David W. Matula and Farhad Shahrokhi. Sparsest cuts and bottlenecks in graphs. Discrete Applied Mathematics, 27(1-2):113-123, 1990.
22. Yu Ofman. On the algorithmic complexity of discrete functions. Soviet Physics Doklady, 7(7):589-591, 1963.
23. David Peleg. Distributed computing: a locality-sensitive approach. SIAM, Philadelphia, PA, USA, 2000.
24. Daniel A. Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proc. of 36th Annual ACM Symposium on Theory of Computing (STOC), pages 81-90, 2004.
25. Daniel A. Spielman and Shang-Hua Teng. A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. CoRR, arXiv: abs/0809.3232v1, 2008.
26. Harold S. Stone. Parallel tridiagonal equation solvers. ACM Transactions on Mathe- matical Software, 1(4):289-307, 1975.