On the second eigenvalue and random walks in random \(d\)-regular graphs (Q1181012)

From MaRDI portal
Revision as of 11:17, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the second eigenvalue and random walks in random \(d\)-regular graphs
scientific article

    Statements

    On the second eigenvalue and random walks in random \(d\)-regular graphs (English)
    0 references
    0 references
    27 June 1992
    0 references
    Let \(A\) be the adjacency matrix of a random \(d\)-regular graph of order \(n\). The largest and second largest absolute eigenvalues of \(A\) are \(\lambda_ 1=d\) and \(\lambda_ 2\), respectively. The probabilistic asymptotic properties of \(\lambda_ 2\) are investigated for fixed \(d\) and increasing \(n\).
    0 references
    random permutations
    0 references
    random graphs
    0 references
    eigenvalue estimation
    0 references
    eigenvalues
    0 references

    Identifiers

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