Erdős-Rényi G(n,p)

Graph Parameters

Statistics

p (edge prob)
Edges
Giant comp. size
Giant / n
# components
2nd largest
⟨k⟩ measured
Threshold: p* = 1/n, ⟨k⟩ = 1
Below: largest O(log n)
Above: giant ~ β·n
β solves β = 1 - e−⟨k⟩β
(self-consistent equation)