# Giant Component in Random Graph

Giant Component in Random Graph

A random graph is a graph with nodes where the probability of finding an edge between two nodes is . When tends to a constant (as grows), the graph will almost surely contain a "giant" connected component, absorbing a considerably large fraction of the nodes. This phenomenon is often mentioned as an example of emergence in random graph behavior.

G(n,p)

n

p

n×p

c>1

n