# Moment-Based Spectral Analysis of Random Graphs with Given Expected Degrees

IEEE Transactions on Network Science and Engineering, pp. 215-228, 2017.

Cited by: 0|Views5
EI WOS

Abstract:

We analyze the eigenvalues of a random graph ensemble, proposed by Chung and Lu, in which a given sequence of expected degrees, denoted by $\overline{w}_n = (w^{(n)}_1,\ldots, w^{(n)}_n)$ , is prescribed on the $n$ nodes of a random graph. We focus on the eigenvalues of the normalized (random) adjacency matrix of the graph ensemble, defi...More

Code:

Data:

Full Text
Bibtex