Supporting Information S1 includes the detailed derivations of characteristic curves of random graphs and LERRGs, discussion on the effects of root selection, robustness test of the network classifica
n: number of entries in the word list; N and E: number of vertices and edges in the network, respectively; k: mean connectivity; L: mean path length; ln(): natural logarithm; C: mean clustering coeffi
