Erdős-Rényi random graph G(N, p): giant component at ⟨k⟩ = 1

Erdős-Rényi 1959-60 (Publ. Math. Debrecen 6:290; Publ. Math. Inst. Hung. Acad. Sci. 5:17) defined the ensemble G(N, p) of undirected graphs on N labelled nodes in which each of the C(N,2) possible edges is present independently with…