Random graph (Erdős–Rényi)

Layer 0 — Mathematicsin the graph-theory subtree

Probability model G(n, p): n vertices, each edge included independently with probability p. Sharp threshold phenomena (connectivity at p=log n/n, giant component at p=1/n).

Related concepts

Explore Random graph (Erdős–Rényi) on the interactive knowledge graph →