Calculates properties of an Erdős-Rényi random graph G(n,p): expected edges E = pn(n−1)/2, average degree ⟨k⟩ = p(n−1), and clustering coefficient p. Giant component emerges when ⟨k⟩ > 1 (p > 1/(n−1)) — below this threshold, the network is fragmented into small isolated components.
Inputs
N Nodes
Count of items or occurrences.
P Edge
Reference formula or conversion factor shown for context.
Results
expected edges E
Reference formula or conversion factor shown for context.