Dynamic Network Sampling for Community Detection

08/29/2022
by   Cong Mu, et al.
0

We propose a dynamic network sampling scheme to optimize block recovery for stochastic blockmodel (SBM) in the case where it is prohibitively expensive to observe the entire graph. Theoretically, we provide justification of our proposed Chernoff-optimal dynamic sampling scheme via the Chernoff information. Practically, we evaluate the performance, in terms of block recovery, of our method on several real datasets from different domains. Both theoretically and practically results suggest that our method can identify vertices that have the most impact on block structure so that one can only check whether there are edges between them to save significant resources but still recover the block structure.

READ FULL TEXT
research
06/22/2022

Community Recovery in the Geometric Block Model

To capture inherent geometric features of many community detection probl...
research
09/16/2017

The Geometric Block Model

To capture the inherent geometric features of many community detection p...
research
01/31/2022

Differentially Private Community Detection for Stochastic Block Models

The goal of community detection over graphs is to recover underlying lab...
research
08/15/2021

Topology-Guided Sampling for Fast and Accurate Community Detection

Community detection is a well-studied problem with applications in domai...
research
02/25/2021

Graph Community Detection from Coarse Measurements: Recovery Conditions for the Coarsened Weighted Stochastic Block Model

We study the problem of community recovery from coarse measurements of a...
research
04/13/2020

Exact recovery and sharp thresholds of Stochastic Ising Block Model

The stochastic block model (SBM) is a random graph model in which the ed...
research
07/20/2023

Exact Community Recovery in the Geometric SBM

We study the problem of exact community recovery in the Geometric Stocha...

Please sign up or login with your details

Forgot password? Click here to reset