On hard limits of eigen-analysis based planted clique detection
暂无分享,去创建一个
[1] C. Donati-Martin,et al. The largest eigenvalues of finite rank deformation of large Wigner matrices: Convergence and nonuniversality of the fluctuations. , 2007, 0706.0136.
[2] Guilhem Semerjian,et al. Sparse random matrices: the eigenvalue spectrum revisited , 2002 .
[3] M E J Newman,et al. Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.
[4] Noga Alon,et al. Finding a large hidden clique in a random graph , 1998, SODA '98.
[5] U. Feige,et al. Finding and certifying a large hidden clique in a semirandom graph , 2000 .
[6] Santosh S. Vempala,et al. Random Tensors and Planted Cliques , 2009, APPROX-RANDOM.
[7] Mark Newman,et al. Networks: An Introduction , 2010 .
[8] M. Newman,et al. Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[9] Frank McSherry,et al. Spectral partitioning of random graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[10] J. W. Silverstein,et al. Spectral Analysis of Large Dimensional Random Matrices , 2009 .
[11] Amin Coja-Oghlan,et al. Algorithmic Barriers from Phase Transitions , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[12] Stephen A. Vavasis,et al. Nuclear norm minimization for the planted clique and biclique problems , 2009, Math. Program..
[13] Raj Rao Nadakuditi,et al. The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices , 2009, 0910.2120.
[14] T. Tao,et al. Random matrices: The Universality phenomenon for Wigner ensembles , 2012, 1202.0068.
[15] Zhidong Bai,et al. Wigner Matrices and Semicircular Law , 2010 .