On tree census and the giant component in sparse random graphs (Q3970912): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The longest path in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The principle of the diffusion of arbitrary constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a functional central limit theorem for Markov population processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson convergence and random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson approximation for some statistics based on exchangeable trials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson approximation for dependent trials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large induced trees in sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal induces trees in sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the probable behaviour of some algorithms for finding the stability number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Random Graph With a Subcritical Number of Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Daley-Kendall model of random rumours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random tree-type partitions as a model for acyclic polymerization: Holtsmark (3/2-stable) distribution of the supercritical gel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are small subgraphs of a random graph normally distributed? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions and critical times for the monodisperse coagulation equation when a<sub>ij</sub>=A + B(i + j) + Cij / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branching-process solution of the polydisperse coagulation equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615818 / rank
 
Normal rank

Latest revision as of 08:51, 15 May 2024

scientific article
Language Label Description Also known as
English
On tree census and the giant component in sparse random graphs
scientific article

    Statements

    On tree census and the giant component in sparse random graphs (English)
    0 references
    25 June 1992
    0 references
    coagulation process
    0 references
    sparse random graph
    0 references
    tree
    0 references
    random sequence
    0 references
    independence
    0 references
    giant component
    0 references
    0 references

    Identifiers