Graph Clustering using Effective Resistance

11/17/2017
by   Vedat Levi Alev, et al.
0

#1#1 We design a polynomial time algorithm that for any weighted undirected graph G = (V, E, w) and sufficiently large δ > 1, partitions V into subsets V_1, ..., V_h for some h≥ 1, such that ∙ at most δ^-1 fraction of the weights are between clusters, i.e. w(E - ∪_i = 1^h E(V_i)) ≲w(E)/δ; ∙ the effective resistance diameter of each of the induced subgraphs G[V_i] is at most δ^3 times the average weighted degree, i.e. _u, v ∈ V_iReff_G[V_i](u, v) ≲δ^3 ·|V|/w(E) for all i=1, ..., h. In particular, it is possible to remove one percent of weight of edges of any given graph such that each of the resulting connected components has effective resistance diameter at most the inverse of the average weighted degree. Our proof is based on a new connection between effective resistance and low conductance sets. We show that if the effective resistance between two vertices u and v is large, then there must be a low conductance cut separating u from v. This implies that very mildly expanding graphs have constant effective resistance diameter. We believe that this connection could be of independent interest in algorithm design.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/11/2018

Paths between colourings of sparse graphs

The reconfiguration graph R_k(G) of the k-colourings of a graph G has as...
research
09/22/2021

On the Connectivity and the Diameter of Betweenness-Uniform Graphs

Betweenness centrality is a centrality measure based on the overall amou...
research
11/03/2022

Connected k-Center and k-Diameter Clustering

Motivated by an application from geodesy, we introduce a novel clusterin...
research
07/16/2022

Solving Graph Laplacians via Multilevel Sparsifiers

We consider effective preconditioners for solving Laplacians of general ...
research
12/04/2018

Diameter Spanner, Eccentricity Spanner, and Approximating Extremal Graph Distances: Static, Dynamic, and Fault Tolerant

The diameter, vertex eccentricities, and the radius of a graph are some ...
research
08/08/2018

Bounds for the diameter of the weight polytope

A weighted game or a threshold function in general admits different weig...
research
09/14/2018

Reconfiguration of graphs with connectivity constraints

A graph G realizes the degree sequence S if the degrees of its vertices ...

Please sign up or login with your details

Forgot password? Click here to reset