首页 | 本学科首页   官方微博 | 高级检索  
     


Sparse random graphs: Eigenvalues and eigenvectors
Authors:Linh V. Tran  Van H. Vu  Ke Wang
Affiliation:Department of Mathematics, Rutgers, Piscataway, New Jersey 08854
Abstract:In this paper, we prove the semi‐circular law for the eigenvalues of regular random graph Gn,d in the case d, complementing a previous result of McKay for fixed d. We also obtain a upper bound on the infinity norm of eigenvectors of Erd?s–Rényi random graph G(n,p), answering a question raised by Dekel–Lee–Linial. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012
Keywords:infinity norm of eigenvector  regular random graphs  semi‐circular law  sparse random matrix
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号