190 citations · 657 across the 32 of their papers we have counts for
9 papers · 1 filter
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…
Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models
Lennart Gulikers, Marc Lelarge, Laurent Massoulié
Motivated by community detection, we characterise the spectrum of the non-backtracking matrix in the Degree-Corrected Stochastic Block Model. Specifically, we consider a random…
On the capacity of information processing systems
Laurent Massoulie, Kuang Xu
We propose and analyze a family of information processing systems, where a finite set of experts or servers are employed to extract information about a stream of incoming jobs. Eac…
An Impossibility Result for Reconstruction in a Degree-Corrected Planted-Partition Model
Lennart Gulikers, Marc Lelarge, Laurent Massoulié
We consider the Degree-Corrected Stochastic Block Model (DC-SBM): a random graph on nodes, having i.i.d. weights (possibly heavy-tailed), partitioned into $q \g…
A spectral method for community detection in moderately-sparse degree-corrected stochastic block models
Lennart Gulikers, Marc Lelarge, Laurent Massoulié
We consider community detection in Degree-Corrected Stochastic Block Models (DC-SBM). We propose a spectral clustering algorithm based on a suitably normalized adjacency matrix. We…
Best-effort networks: modeling and performance analysis via large networks asymptotics
Guy Fayolle, Arnaud De La Fortelle, Jean-Marc Lasgouttes +2
In this paper we introduce a class of Markov models, termed best-effort networks, designed to capture performance indices such as mean transfer times in data networks with best-eff…