17 citations · 67 across the 16 of their papers we have counts for
Showing math.PRShow all
3 papers · 1 filter
math.PR2022
Sparse random hypergraphs: Non-backtracking spectra and community detection
Ludovic Stephan, Yizhe Zhu
We consider the community detection problem in a sparse -uniform hypergraph , assuming that is generated according to the Hypergraph Stochastic Block Model (HSBM). We pro…
math.PR2020★ 3 cited
Non-backtracking spectra of weighted inhomogeneous random graphs
Ludovic Stephan, Laurent Massoulié
We study a model of random graphs where each edge is drawn independently (but not necessarily identically distributed) from the others, and then assigned a random weight. When the…
math.PR2018★ 5 cited
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…