4 citations · 4 across the 1 of their papers we have counts for
3 papers
cs.LG2021★ 4 cited
A simpler spectral approach for clustering in directed networks
Simon Coste, Ludovic Stephan
We study the task of clustering in directed networks. We show that using the eigenvalue/eigenvector decomposition of the adjacency matrix is simpler than all common methods which a…
cs.DS2018
Robustness of spectral methods for community detection
Ludovic Stephan, Laurent Massoulié
The present work is concerned with community detection. Specifically, we consider a random graph drawn according to the stochastic block model~: its vertex set is partitioned into…
math.PR2018
Planting trees in graphs, and finding them back
Laurent Massoulié, Ludovic Stephan, Don Towsley
In this paper we study detection and reconstruction of planted structures in Erdős-Rényi random graphs. Motivated by a problem of communication security, we focus on planted struct…