Spectra of large diluted but bushy random graphs (Q2818279)

From MaRDI portal





scientific article; zbMATH DE number 6624748
Language Label Description Also known as
English
Spectra of large diluted but bushy random graphs
scientific article; zbMATH DE number 6624748

    Statements

    Spectra of large diluted but bushy random graphs (English)
    0 references
    0 references
    0 references
    7 September 2016
    0 references
    random graph
    0 references
    random trees
    0 references
    adjacency matrix' random matrices
    0 references
    semi-circle law
    0 references
    Let \(G(n.c/n)\) be an Erdős-Rényi random graph and \(\mu^{c}\) be the limit of the empirical spectral measures of the adjacency matrices of these graphs as \(n\rightarrow\infty\). (The empirical spectral measure assigns to a set \(S\subseteq \mathbb{R}\) the number of eigenvalues of the adjacency matrix which are in \(S\), divided by \(n\).) It is well known that \(\mu^{c}\) exists and depends on \(c\) (unlike the situation for \(G(n,p)\) where \(\lim_{n\rightarrow\infty}np=\infty\), when the limit of the empirical spectral measures is always the Wigner semi-circle law).NEWLINENEWLINEThe aim of the paper under review is to understand \(\mu^{c}\) better for large \(c\). In detail, what is done is to work out an asymptotic expansion of \(\mu^{c}\) in terms of \(1/c\). The proofs depend on computing moments of \(\mu^{c}\), which turn out to be closely related to closed walks on the graphs -- it turns out that only certain walks contribute. While the main term in the expansion is again Wigner's semi-circle law, the derivation of the second order term involves delicate computations with generating functions, and moving around between the sparse graphs and the infinite tree which they approximate as \(n\rightarrow\infty\).
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references