On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase (Q939084)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase
scientific article

    Statements

    On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase (English)
    0 references
    20 August 2008
    0 references
    A uniform random graph \(G\) of order \(n\) with a fixed degree sequence obeying a \(\gamma\) subpower law is studied. For \(\gamma>3\) the order of the largest component of \(G\) is shown with high probability to be a power of \(n\) not exceeding \(\gamma-1 + O(\log \log n / \log n)\).
    0 references
    random graph
    0 references
    degree sequence
    0 references
    power law
    0 references
    largest component
    0 references
    0 references

    Identifiers

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