Robustness of Community Detection to Random Geometric Perturbations

11/09/2020
by   Sandrine Péché, et al.
0

We consider the stochastic block model where connection between vertices is perturbed by some latent (and unobserved) random geometric graph. The objective is to prove that spectral methods are robust to this type of noise, even if they are agnostic to the presence (or not) of the random graph. We provide explicit regimes where the second eigenvector of the adjacency matrix is highly correlated to the true community vector (and therefore when weak/exact recovery is possible). This is possible thanks to a detailed analysis of the spectrum of the latent random graph, of its own interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
11/14/2018

Robustness of spectral methods for community detection

The present work is concerned with community detection. Specifically, we...
research
10/10/2019

Exact Recovery of Community Detection in k-partite Graph Models

We study the vertex classification problem on a graph in which the verti...
research
09/08/2016

Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models

Motivated by community detection, we characterise the spectrum of the no...
research
04/26/2019

Spectral partitioning of time-varying networks with unobserved edges

We discuss a variant of `blind' community detection, in which we aim to ...
research
09/09/2021

Popularity Adjusted Block Models are Generalized Random Dot Product Graphs

We connect two random graph models, the Popularity Adjusted Block Model ...

Please sign up or login with your details

Forgot password? Click here to reset