Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
Keywords: Densest Subgraph, Strongly Localized Graph Algorithms, Hypergraph Algorithms, Maximum Flow, Supermodular Functions
TL;DR: We propose two localized densest subhypergraph objectives and prove several interesting results for them and the general densest subgraph discovery problem.
Abstract: Dense subgraph discovery is a fundamental primitive in graph and hypergraph analysis which among other applications has been used for real-time story detection on social media and improving access to data stores of social networking systems. We present several contributions for localized densest subgraph discovery, which seeks dense subgraphs located nearby a given seed sets of nodes. We first introduce a generalization of a recent $\text{\emph{anchored densest subgraph}}$ problem, extending this previous objective to hypergraphs and also adding a tunable locality parameter that controls the extent to which the output set overlaps with seed nodes. Our primary technical contribution is to prove when it is possible to obtain a strongly-local algorithm for solving this problem, meaning that the runtime depends only on the size of the input set. We provide a strongly-local algorithm that applies whenever the locality parameter is at least 1, and show why via counterexample that strongly-local algorithms are impossible below this threshold. Along the way to proving our results for localized densest subgraph discovery, we also provide several advances in solving global dense subgraph discovery objectives. This includes the first strongly polynomial time algorithm for the densest supermodular set problem and a flow-based exact algorithm for a densest subgraph discovery problem in graphs with arbitrary node weights. We demonstrate the utility of our algorithms on several web-based data analysis tasks.
Track: Graph Algorithms and Learning for the Web
Submission Guidelines Scope: Yes
Submission Guidelines Blind: Yes
Submission Guidelines Format: Yes
Submission Guidelines Limit: Yes
Submission Guidelines Authorship: Yes
Student Author: Yes
Submission Number: 1875
Loading