Multicyclic components in a random graph process

DOI10.1002/RSA.3240040105zbMATH Open0766.60014OpenAlexW2001951510MaRDI QIDQ4034709FDOQ4034709

Authors: 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

Recommendations

• Cycles and Unicyclic Components in Random Graphs
• Cycles in random graphs
• A kinetic approach to the random \(f\)-graph process. Paths, cycles and components
• Birth and growth of multicyclic components in random hypergraphs
• Stochastic processes in random graphs
• Characterization of Cycle Stochastic Graphs
• Stochastic processes on random graphs with multiple type edges
• Cycles in random bipartite graphs

zbMATH Keywords

weak convergencerandom graph processfactorial momentsdrawing without replacement

Mathematics Subject Classification ID

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

Cites Work

• Poisson convergence and Poisson processes with applications to random graphs
• The first cycles in an evolving graph
• On the random graph structure near the critical point
• A functional limit theorem for random graphs with applications to subgraph count statistics
• Title not available (Why is that?)

Cited In (10)

• On the length of a random minimum spanning tree
• On the growth of components with non-fixed excesses
• On the difference of expected lengths of minimum spanning trees
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The first cycles in an evolving graph
• Unlacing hypercube percolation: a survey
• The random-cluster model on the complete graph
• Birth and growth of multicyclic components in random hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Multicyclic components in a random graph process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4034709)