DeepAI AI Chat
Log In Sign Up

Most Probable Densest Subgraphs

by   Arkaprava Saha, et al.

Computing the densest subgraph is a primitive graph operation with critical applications in detecting communities, events, and anomalies in biological, social, Web, and financial networks. In this paper, we study the novel problem of Most Probable Densest Subgraph (MPDS) discovery in uncertain graphs: Find the node set that is the most likely to induce a densest subgraph in an uncertain graph. We further extend our problem by considering various notions of density, e.g., clique and pattern densities, studying the top-k MPDSs, and finding the node set with the largest containment probability within densest subgraphs. We show that it is #P-hard to compute the probability of a node set inducing a densest subgraph. We then devise sampling-based efficient algorithms, with end-to-end accuracy guarantees, to compute the MPDS. Our thorough experimental results and real-world case studies on brain and social networks validate the effectiveness, efficiency, and usefulness of our solution.


page 13

page 14

page 15


Efficient Algorithms for Densest Subgraph Discovery

Densest subgraph discovery (DSD) is a fundamental problem in graph minin...

Efficient Representation Learning of Subgraphs by Subgraph-To-Node Translation

A subgraph is a data structure that can represent various real-world pro...

An Efficient System for Subgraph Discovery

Subgraph discovery in a single data graph---finding subsets of vertices ...

Discriminative Feature Selection for Uncertain Graph Classification

Mining discriminative features for graph data has attracted much attenti...

Subgraph nomination: Query by Example Subgraph Retrieval in Networks

This paper introduces the subgraph nomination inference task, in which e...

VerSaChI: Finding Statistically Significant Subgraph Matches using Chebyshev's Inequality

Approximate subgraph matching, which is an important primitive for many ...

An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs

Uncertain, or probabilistic, graphs have been increasingly used to repre...