Figure 1.

(a) Schematic diagram of the spectral graph distance described by Eqs (3) and (5). The distributions and are obtained from the rth eigenvectors of the Laplacian matrix L⁽¹⁾ corresponding to the network G⁽¹⁾ and L⁽²⁾ corresponding to G⁽²⁾. (b) The spectral graph distances and the Hamming distances between the networks G(p_o) and G(p) generated from the WS model, where the value of p is varied and p_o takes the fixed constant value (p_o = 0.1). The number of nodes N = 500, and each node has on average k = 10 links. The grey area indicates ± standard deviation.