Title: Dual Algorithms for the Densest Subgraph Problem
Advisor: Dr. Richard Peng, College of Computing, Georgia Institute of Technology
Committee:
Dr. Dana Randall, College of Computing, Georgia Institute of Technology
Dr. Eric Vigoda, College of Computing, Georgia Institute of Technology
Dr. Xingxing Yu, School of Mathematics, Georgia Institute of Technology
Dr. Charalampos E. Tsourakakis, Department of Computer Science, Boston University
Reader: Dr. Charalampos E. Tsourakakis, Department of Computer Science, Boston University
Summary: Dense subgraph discovery is an important primitive for many real-world graph mining applications. The dissertation tackles the densest subgraph problem via its dual linear programming formulation. Particularly, our contributions in this thesis are the following: (i) We give a faster width-dependent algorithm to solve mixed packing and covering LPs, a class of problems that is fundamental to combinatorial optimization in computer science and operations research (the dual of the densest subgraph problem is an instance of this class of linear programs) . Our work utilizes the framework of area convexity introduced by Sherman [STOC `17] to obtain accelerated rates of convergence. (ii) We devise an iterative algorithm for the densest subgraph problem which naturally generalizes Charikar's greedy algorithm. Our algorithm draws insights from the iterative approaches from convex optimization, and also exploits the dual interpretation of the densest subgraph problem. We have empirical evidence that our algorithm is much more robust against the structural heterogeneities in real-world datasets, and converges to the optimal subgraph density even when the simple greedy algorithm fails. (iii) Lastly, we design the first fully-dynamic algorithm which maintains a $(1-\epsilon)$ approximate densest subgraph in worst-case $\text{poly}(\log n, \epsilon^{-1})$ time per update. Our result improves upon the previous best approximation factor of $(1/4 - \epsilon)$ for fully dynamic densest subgraph.
