Asymptotic normality of triad counts in random digraphs
Triad counts for directed graphs are represented as numerators of incomplete U-statistics with symmetric or asymmetric kernels. Asymptotic normality for the simultaneous distribution of all triad counts is proved. Applications are given to investigations of inconsistency in tournaments and reliability of communication networks.