摘要: We show that the largest eigenvalues of graphs whose highest degrees are Zipf-like distributed with slope a according to power law α/2. This follows as direct and almost certain corollary degree law. Our result has implications for singular value decomposition method in information retrieval.
springer.com
acm.org 
sci-hub.se 参考文章(29)
Ji-guang Sun, G. W. Stewart, Matrix perturbation theory ,(1990)
Ibrahim Matta, Anukool Lakhina, John Byers, Alberto Medina, BRITE: Universal Topology Generation from a User''s Perspective Boston University. ,(2001)
Anna R Karlin, None, Spectral Analysis for Data Mining algorithm engineering and experimentation. pp. 188- 188 ,(2001) , 10.1007/3-540-44808-X_15
Colin Cooper, Alan M. Frieze, A General Model of Undirected Web Graphs european symposium on algorithms. pp. 500- 511 ,(2001) , 10.1007/3-540-44676-1_42
László Lovász, Combinatorial problems and exercises ,(1979)
W. Aiello, Fan Chung, Linyuan Lu, Random evolution in massive graphs foundations of computer science. pp. 97- 122 ,(2002) , 10.1109/SFCS.2001.959927
Parry Husbands, Horst Simon, Chris H. Q. Ding, On the use of the singular value decomposition for text retrieval Computational information retrieval. pp. 145- 156 ,(2001)
Michalis Faloutsos, Petros Faloutsos, Christos Faloutsos, On power-law relationships of the Internet topology acm special interest group on data communication. ,vol. 29, pp. 251- 262 ,(1999) , 10.1145/316188.316229
Alberto Medina, Ibrahim Matta, John Byers, On the origin of power laws in Internet topologies ACM SIGCOMM Computer Communication Review. ,vol. 30, pp. 18- 28 ,(2000) , 10.1145/505680.505683
Albert-László Barabási, Réka Albert, Emergence of Scaling in Random Networks Science. ,vol. 286, pp. 509- 512 ,(1999) , 10.1126/SCIENCE.286.5439.509