Phase transition of the minimum degree random multigraph process

DOI10.1002/RSA.20170MaRDI QIDQ5433265zbMATH OpenOpenAlexFDO

Authors Mihyun Kang, Taral Guldahl Seierstad

Publication date 8 January 2008

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

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

zbMATH Keywords

branching processphase transitionrandom graphrandom graph process

Mathematics Subject Classification ID

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

Recommendations

• The connectivity threshold for the min‐degree random graph process
• On a random graph evolving by degrees
• scientific article; zbMATH DE number 5314553
• The evolution of the min-min random graph process
• Sudden emergence of a giant k-core in a random graph

Cites work

• Birth control for giants

Cited in

(6)

• A central limit theorem via differential equations
• The evolution of the min-min random graph process
• On the normality of giant components
• scientific article; zbMATH DE number 6500825 (Why is no real title available?)
• scientific article; zbMATH DE number 5314553 (Why is no real title available?)
• Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models

This page was built for publication: Phase transition of the minimum degree random multigraph process

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