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 ...
a good way of having different viewpoints and skills involved in a project provide staff with an opportunity to learn new skills from other members of the team which ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback