Network growth and the spectral evolution model
This source preferred by Damien Fay
Authors: Fay, D., Kunegis, J. and Bauckhage, C.
Start date: 26 October 2010
Journal: Proceedings of the 19th ACM international conference on Information and knowledge management
Abstract We introduce and study the spectral evolution model, which characterizes the growth of large networks in terms of the eigenvalue decomposition of their adjacency matrices: In large networks, changes over time result in a change of a graph's spectrum, leaving the eigenvectors unchanged. We validate this hypothesis for several large social, collaboration, authorship, rating, citation, communication and tagging networks, covering unipartite, bipartite, signed and unsigned graphs. Following these observations, we ...