We consider the random directed graph G→(n,p) with vertex set {1,2,…,n} in which each of n(n−1) possible edges is present independently probability p. are interested strongly connected components this graph. A phase transition for emergence a giant component known to occur at p=1/n, critical window p=1/n+λn−4/3 λ∈R. show that, within window, G→(n,p), ranked decreasing order size and rescaled by...