On a connection between small set expansions and modularity clustering
From MaRDI portal
Publication:2446591
Abstract: In this paper we explore a connection between two seemingly different problems from two different domains: the small-set expansion problem studied in unique games conjecture, and a popular community finding approach for social networks known as the modularity clustering approach. We show that a sub-exponential time algorithm for the small-set expansion problem leads to a sub-exponential time constant factor approximation for some hard input instances of the modularity clustering problem.
Recommendations
- Graph expansion and the unique games conjecture
- Subexponential algorithms for unique games and related problems
- Min-Max Graph Partitioning and Small Set Expansion
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis
- Approximation algorithms for hypergraph small set expansion and small set vertex expansion
Cites work
Cited in
(2)
This page was built for publication: On a connection between small set expansions and modularity clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446591)