New Abilities and Limitations of Spectral Graph Bisection

Spectral based heuristics belong to well-known commonly used methods for finding a minimum-size bisection in a graph. The heuristics are usually easy to implement and they work well for several practice-relevant classes of graphs. However, only a few research efforts are focused on providing rigorous analysis of such heuristics and often they lack of proven optimality or approximation quality. This paper focuses on the spectral heuristic proposed by Boppana almost three decades ago, which still belongs to one of the most important bisection methods. It is well known that Boppana's algorithm finds and certifies an optimal bisection with high probability in the random planted bisection model -- the standard model which captures many real-world instances. In this model the vertex set is partitioned randomly into two equal sized sets, and then each edge inside the same part of the partition is chosen with probability $p$ and each edge crossing the partition is chosen with probability $q$, with $p \ge q$. In our paper we investigate the problem if Boppana's algorithm works well in the semirandom model introduced by Feige and Kilian. The model generates initially an instance by random selection within the planted bisection model, followed by adversarial decisions. Feige and Kilian posed the question if Boppana's algorithm works well in the semirandom model and it has remained open so far. In our paper we answer the question affirmatively. We show also that the algorithm achieves similar performance on graph models which generalize the semirandom model. On the other hand we prove some limitations: we show that if the density difference $p-q \le o(\sqrt{p\cdot \ln n}/\sqrt{n})$ then the algorithm fails with high probability in the planted bisection model. This bound is sharp, since under assumption $p-q \ge \Omega(\sqrt{p\cdot \ln n}/\sqrt{n})$ Boppana's algorithm works well in the model.

[1]  Uriel Feige,et al.  Heuristics for Semirandom Graph Problems , 2001, J. Comput. Syst. Sci..

[2]  Kathryn B. Laskey,et al.  Stochastic blockmodels: First steps , 1983 .

[3]  Robert D. BlumofeJanuary Spectral Methods for Bisecting Graphs , 1993 .

[4]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[5]  Joel H. Spencer,et al.  Coloring Random and Semi-Random k-Colorable Graphs , 1995, J. Algorithms.

[6]  Frank Thomson Leighton,et al.  A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..

[7]  Anton van den Hengel,et al.  Semidefinite Programming , 2014, Computer Vision, A Reference Guide.

[8]  Irfan A. Essa,et al.  Graphcut textures: image and video synthesis using graph cuts , 2003, ACM Trans. Graph..

[9]  Frank McSherry,et al.  Spectral partitioning of random graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[10]  Richard M. Leahy,et al.  An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  M. Fiedler A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[12]  Richard M. Karp,et al.  Algorithms for graph partitioning on the planted partition model , 2001, Random Struct. Algorithms.

[13]  Chih-Chien Tu,et al.  Spectral methods for graph bisection problems , 1998, Comput. Oper. Res..

[14]  Robert Krauthgamer,et al.  A Polylogarithmic Approximation of the Minimum Bisection , 2006, SIAM Rev..

[15]  Béla Bollobás,et al.  Max Cut for Random Graphs with a Planted Partition , 2004, Combinatorics, Probability and Computing.

[16]  Russell Impagliazzo,et al.  Hill-climbing finds random planted bisections , 2001, SODA '01.

[17]  Emmanuel Abbe,et al.  Exact Recovery in the Stochastic Block Model , 2014, IEEE Transactions on Information Theory.

[18]  Uriel Feige Robert Krauthgamer Kobbi,et al.  Approximating the minimum bisection size , 2000 .

[19]  Stephen Guattery,et al.  On the Quality of Spectral Separators , 1998, SIAM J. Matrix Anal. Appl..

[20]  Robert van Engelen,et al.  Graph Partitioning for High Performance Scienti c Simulations , 2000 .

[21]  Vijay V. Vazirani,et al.  Finding k-cuts within twice the optimal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[22]  F. Harary,et al.  A survey of the theory of hypercube graphs , 1988 .

[23]  David S. Johnson,et al.  Stockmeyer: some simplified np-complete graph problems , 1976 .

[24]  Shang-Hua Teng,et al.  Spectral partitioning works: planar graphs and finite element meshes , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[25]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[26]  Marek Karpinski,et al.  Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems , 1999, J. Comput. Syst. Sci..

[27]  D. Spielman,et al.  Spectral partitioning works: planar graphs and finite element meshes , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[28]  Cristopher Moore,et al.  The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness , 2017, Bull. EATCS.

[29]  Amin Coja-Oghlan,et al.  Local Convergence of Random Graph Colorings , 2018, Comb..

[30]  Saket Saurabh,et al.  Minimum Bisection Is Fixed-Parameter Tractable , 2019, SIAM J. Comput..

[31]  Franz Rendl,et al.  A computational study of graph partitioning , 1994, Math. Program..

[32]  Elchanan Mossel,et al.  Consistency thresholds for the planted bisection model , 2016 .

[33]  Elchanan Mossel,et al.  Consistency Thresholds for the Planted Bisection Model , 2014, STOC.

[34]  Peter Sanders,et al.  Recent Advances in Graph Partitioning , 2013, Algorithm Engineering.

[35]  René van Bevern,et al.  On the Parameterized Complexity of Computing Graph Bisections , 2013, WG.

[36]  Martin E. Dyer,et al.  The Solution of Some Random NP-Hard Problems in Polynomial Expected Time , 1989, J. Algorithms.

[37]  Frank Thomson Leighton,et al.  Graph bisection algorithms with good average case behavior , 1984, Comb..

[38]  Subhash Khot,et al.  Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[39]  Aravindan Vijayaraghavan,et al.  Approximation algorithms for semi-random partitioning problems , 2012, STOC '12.

[40]  Ravi B. Boppana,et al.  Eigenvalues and graph bisection: An average-case analysis , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[41]  Dániel Marx,et al.  Parameterized graph separation problems , 2004, Theor. Comput. Sci..

[42]  A. Frieze Spectral Techniques, Semidefinite Programs, and Random Graphs , 2005 .

[43]  Bruce E. Hajek,et al.  Achieving exact cluster recovery threshold via semidefinite programming , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[44]  A. Coja-Oghlan A spectral heuristic for bisecting random graphs , 2006 .

[45]  Emmanuel Abbe,et al.  Community detection and stochastic block models: recent developments , 2017, Found. Trends Commun. Inf. Theory.

[46]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[47]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[48]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[49]  Ce-Kuen Shieh,et al.  Algorithms for graph partitioning problems by means of eigenspace relaxations , 2000, Eur. J. Oper. Res..

[50]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..