We consider inhomogeneous Erdős–Rényi graphs. We suppose that the maximal mean degree d satisfies d ≪ logn. We characterise the asymptotic behaviour of the n1–o(1) largest eigenvalues of the adjacency ...
This is a preview. Log in through your library . Abstract There is increasing interest in the study of community detection for sparse networks. Here, we propose a new method for detecting communities ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback