Asymptotics for the size of the largest component scaled to ``\(\log n\)'' in inhomogeneous random graphs (Q363503): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The phase transition in the uniformly grown random graph has infinite order / rank
 
Normal rank
Property / cites work
 
Property / cites work: The phase transition in inhomogeneous random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5806970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest component in a subcritical random graph with a power law degree distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiplicative Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase transitions in dynamical random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Merging percolation on<i>Z</i><i>d</i>and classical random graphs: Phase transition / rank
 
Normal rank

Latest revision as of 20:22, 6 July 2024

scientific article
Language Label Description Also known as
English
Asymptotics for the size of the largest component scaled to ``\(\log n\)'' in inhomogeneous random graphs
scientific article

    Statements

    Asymptotics for the size of the largest component scaled to ``\(\log n\)'' in inhomogeneous random graphs (English)
    0 references
    0 references
    2 September 2013
    0 references
    0 references
    branching processes
    0 references
    inhomogeneous random graphs
    0 references
    subcritical case
    0 references
    survival probability
    0 references
    0 references
    0 references