Abstract

In power law graphs, cut quality varies inversely with cut balance. Using some million node social graphs as a test bed, we empirically investigate this property and its implications for graph partitioning. We use six algorithms, including Metis and MQI (state of the art methods for finding bisections and quotient cuts) and four relaxation/rounding methods. We find that an SDP relaxation avoids the Spectral method’s tendency to break off tiny pieces of the graph. We also find that a flow-based rounding method works better than hyperplane rounding. 1

Citations

905	Fast approximate energy minimization via graph cuts - Boykov, Veksler, et al.
149	The average distances in random graphs with given expected degrees - Chung, Lu
137	λ1, isoperimetric inequalities for graphs, and superconcentrators - Alon, Milman - 1985
127	Lower bounds for partitioning of graphs - Donath, Homan - 1973
119	On implementing the push—relabel method for the maximum flow problem - Cherkassky, Goldberg - 1997
69	A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization - Burer, Monteiro - 2003
43	Conductance and congestion in power law graphs - Gkantsidis, Mihail, et al.
14	Local minima and convergence in low-rank semidefinite programming - Burer, Monteiro