skip to main content

SciTech ConnectSciTech Connect

Title: Finding Hierarchical and Overlapping Dense Subgraphs using Nucleus Decompositions

Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. Yet most standard formulations of this problem (like clique, quasiclique, k-densest subgraph) are NP-hard. Furthermore, the goal is rarely to nd the \true optimum", but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine a hierarchical structure among them. Current dense subgraph nding algorithms usually optimize some objective, and only nd a few such subgraphs without providing any hierarchy. It is also not clear how to account for overlaps in dense substructures. We de ne the nucleus decomposition of a graph, which represents the graph as a forest of nuclei. Each nucleus is a subgraph where smaller cliques are present in many larger cliques. The forest of nuclei is a hierarchy by containment, where the edge density increases as we proceed towards leaf nuclei. Sibling nuclei can have limited intersections, which allows for discovery of overlapping dense subgraphs. With the right parameters, the nuclear decomposition generalizes the classic notions of k-cores and k-trusses. We give provable e cient algorithms for nuclear decompositions, and empirically evaluate their behavior inmore » a variety of real graphs. The tree of nuclei consistently gives a global, hierarchical snapshot of dense substructures, and outputs dense subgraphs of higher quality than other state-of-theart solutions. Our algorithm can process graphs with tens of millions of edges in less than an hour.« less
Authors:
 [1] ;  [2] ;  [2] ;  [1]
  1. The Ohio State Univ., Columbus, OH (United States)
  2. Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Publication Date:
OSTI Identifier:
1172917
Report Number(s):
SAND2014--19934R
543218
DOE Contract Number:
AC04-94AL85000
Resource Type:
Technical Report
Research Org:
Sandia National Laboratories (SNL-CA), Livermore, CA (United States)
Sponsoring Org:
USDOE; DARPA
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING k-core; k-truss; decomposition; hierarchy; overlapping subgraphs; dense subgraph discovery