Eigenvalue Spectra Measurements of Complex Networks.

摘要: Complex network models such as Kauffman’s NK model have been shown to interesting phase transitional properties the connectivity is varied. Conventional and graph analysis metrics concerning path-lengths, numbers of components even circuits used explore these transitions. This paper presents use matrix techniques relate shape form eigenvalue spectrum adjacency matrices complex networks transition. A number computational experiments with different realisations yield results for Kauffman at K = 1, 2, ..., 7 are discussed in terms transition atK 2.