Universal relation for transport in non-sparse complex networks*
Wang Yana), Yang Xiao-Rongb)
       
Localization of Laplacian eigenvectors is shown for five types of networks. The network size is fixed to be N = 1000. We compute f nm for each Laplacian eigenvector u m , whose corresponding eigenvalue is λ m . The diagonal pattern implies the localization of Laplacian eigenvectors. (a) SF, k min = 1, (b) SF, k min = 10, (c) ER, p = 0.006, (d) ER, p = 0.1, (e) EXP, k min = 1, (f) EXP, k min = 10, (g) SW, k nn = 3, p r = 0.03, (h) SW, k nn = 3, p r = 0.6, (i) SW, k nn = 5, p r = 0.03, (j) SW, k nn = 5, p r = 0.6, (k) clustered, k nn = 3, p r = 0.001, (l) clustered, p out = 0.1.