# Adjacent matrix of undirected graph with a giant component

Assuming there is a undirected random graph $G=(V,E)$, $|V|=N$ and its adjacent matirx is $A$.

What is the sufficient and necessary conditions of A for that there is a giant component of graph $G$?

We means that there is a large connected component with more than $2N/3$ nodes by a giant component.

-