Multicyclic components in a random graph process

DOI10.1002/rsa.3240040105zbMath0766.60014OpenAlexW2001951510MaRDI QIDQ4034709

Svante Janson

Publication date: 16 May 1993

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240040105

zbMATH Keywords

weak convergencefactorial momentsrandom graph processdrawing without replacement

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items

Brownian excursions, critical random graphs and the multiplicative coalescent, The random-cluster model on the complete graph, Birth and growth of multicyclic components in random hypergraphs, On the Length of a Random Minimum Spanning Tree, Unlacing hypercube percolation: a survey, On the Difference of Expected Lengths of Minimum Spanning Trees, On the growth of components with non-fixed excesses

Cites Work

• Unnamed Item
• The first cycles in an evolving graph
• Poisson convergence and Poisson processes with applications to random graphs
• A functional limit theorem for random graphs with applications to subgraph count statistics
• On the random graph structure near the critical point