Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks

11/07/2022
by   Yasushi Kawase, et al.
0

Network analysis has played a key role in knowledge discovery and data mining. In many real-world applications in recent years, we are interested in mining multilayer networks, where we have a number of edge sets called layers, which encode different types of connections and/or time-dependent connections over the same set of vertices. Among many network analysis techniques, dense subgraph discovery, aiming to find a dense component in a network, is an essential primitive with a variety of applications in diverse domains. In this paper, we introduce a novel optimization model for dense subgraph discovery in multilayer networks. Our model aims to find a stochastic solution, i.e., a probability distribution over the family of vertex subsets, rather than a single vertex subset, whereas it can also be used for obtaining a single vertex subset. For our model, we design an LP-based polynomial-time exact algorithm. Moreover, to handle large-scale networks, we also devise a simple, scalable preprocessing algorithm, which often reduces the size of the input networks significantly and results in a substantial speed-up. Computational experiments demonstrate the validity of our model and the effectiveness of our algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2020

Online Dense Subgraph Discovery via Blurred-Graph Feedback

Dense subgraph discovery aims to find a dense component in edge-weighted...
research
07/03/2020

Finding Densest k-Connected Subgraphs

Dense subgraph discovery is an important graph-mining primitive with a v...
research
12/06/2021

Dense and well-connected subgraph detection in dual networks

Dense subgraph discovery is a fundamental problem in graph mining with a...
research
04/17/2019

Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries

In the densest subgraph problem, given a weighted undirected graph G(V,E...
research
06/03/2019

Cores and Other Dense Structures in Complex Networks

Complex networks are a powerful paradigm to model complex systems. Speci...
research
02/27/2021

Parallel Algorithms for Densest Subgraph Discovery Using Shared Memory Model

The problem of finding dense components of a graph is a widely explored ...
research
07/31/2023

Subnetwork enumeration algorithms for multilayer networks

To understand the structure of a network, it can be useful to break it d...

Please sign up or login with your details

Forgot password? Click here to reset