35 research outputs found

    An SDP-Based Algorithm for Linear-Sized Spectral Sparsification

    Full text link
    For any undirected and weighted graph G=(V,E,w)G=(V,E,w) with nn vertices and mm edges, we call a sparse subgraph HH of GG, with proper reweighting of the edges, a (1+ε)(1+\varepsilon)-spectral sparsifier if (1−ε)x⊺LGx≤x⊺LHx≤(1+ε)x⊺LGx (1-\varepsilon)x^{\intercal}L_Gx\leq x^{\intercal} L_{H} x\leq (1+\varepsilon) x^{\intercal} L_Gx holds for any x∈Rnx\in\mathbb{R}^n, where LGL_G and LHL_{H} are the respective Laplacian matrices of GG and HH. Noticing that Ω(m)\Omega(m) time is needed for any algorithm to construct a spectral sparsifier and a spectral sparsifier of GG requires Ω(n)\Omega(n) edges, a natural question is to investigate, for any constant ε\varepsilon, if a (1+ε)(1+\varepsilon)-spectral sparsifier of GG with O(n)O(n) edges can be constructed in O~(m)\tilde{O}(m) time, where the O~\tilde{O} notation suppresses polylogarithmic factors. All previous constructions on spectral sparsification require either super-linear number of edges or m1+Ω(1)m^{1+\Omega(1)} time. In this work we answer this question affirmatively by presenting an algorithm that, for any undirected graph GG and ε>0\varepsilon>0, outputs a (1+ε)(1+\varepsilon)-spectral sparsifier of GG with O(n/ε2)O(n/\varepsilon^2) edges in O~(m/εO(1))\tilde{O}(m/\varepsilon^{O(1)}) time. Our algorithm is based on three novel techniques: (1) a new potential function which is much easier to compute yet has similar guarantees as the potential functions used in previous references; (2) an efficient reduction from a two-sided spectral sparsifier to a one-sided spectral sparsifier; (3) constructing a one-sided spectral sparsifier by a semi-definite program.Comment: To appear at STOC'1

    Similarity-Aware Spectral Sparsification by Edge Filtering

    Full text link
    In recent years, spectral graph sparsification techniques that can compute ultra-sparse graph proxies have been extensively studied for accelerating various numerical and graph-related applications. Prior nearly-linear-time spectral sparsification methods first extract low-stretch spanning tree from the original graph to form the backbone of the sparsifier, and then recover small portions of spectrally-critical off-tree edges to the spanning tree to significantly improve the approximation quality. However, it is not clear how many off-tree edges should be recovered for achieving a desired spectral similarity level within the sparsifier. Motivated by recent graph signal processing techniques, this paper proposes a similarity-aware spectral graph sparsification framework that leverages efficient spectral off-tree edge embedding and filtering schemes to construct spectral sparsifiers with guaranteed spectral similarity (relative condition number) level. An iterative graph densification scheme is introduced to facilitate efficient and effective filtering of off-tree edges for highly ill-conditioned problems. The proposed method has been validated using various kinds of graphs obtained from public domain sparse matrix collections relevant to VLSI CAD, finite element analysis, as well as social and data networks frequently studied in many machine learning and data mining applications

    Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs

    Get PDF
    Packing and covering semidefinite programs (SDPs) appear in natural relaxations of many combinatorial optimization problems as well as a number of other applications. Recently, several techniques were proposed, that utilize the particular structure of this class of problems, to obtain more efficient algorithms than those offered by general SDP solvers. For certain applications, such as those described in this paper, it maybe required to deal with SDP\u27s with exponentially or infinitely many constraints, which are accessible only via an oracle. In this paper, we give an efficient primal-dual algorithm to solve the problem in this case, which is an extension of a logarithmic-potential based algorithm of Grigoriadis, Khachiyan, Porkolab and Villavicencio (SIAM Journal of Optimization 41 (2001)) for packing/covering linear programs

    Communication-Optimal Distributed Dynamic Graph Clustering

    Full text link
    We consider the problem of clustering graph nodes over large-scale dynamic graphs, such as citation networks, images and web networks, when graph updates such as node/edge insertions/deletions are observed distributively. We propose communication-efficient algorithms for two well-established communication models namely the message passing and the blackboard models. Given a graph with nn nodes that is observed at ss remote sites over time [1,t][1,t], the two proposed algorithms have communication costs O~(ns)\tilde{O}(ns) and O~(n+s)\tilde{O}(n+s) (O~\tilde{O} hides a polylogarithmic factor), almost matching their lower bounds, Ω(ns)\Omega(ns) and Ω(n+s)\Omega(n+s), respectively, in the message passing and the blackboard models. More importantly, we prove that at each time point in [1,t][1,t] our algorithms generate clustering quality nearly as good as that of centralizing all updates up to that time and then applying a standard centralized clustering algorithm. We conducted extensive experiments on both synthetic and real-life datasets which confirmed the communication efficiency of our approach over baseline algorithms while achieving comparable clustering results.Comment: Accepted and to appear in AAAI'1
    corecore