We analyze the largest eigenvalue and eigenvector for the adjacency matrices of sparse random graph. Let λ1 be the largest eigenvalue of an n-vertex graph, and v1 be its corresponding normalized eigenvector. For graphs of average degree d log n, where d is a large enough constant, we show λ1 = d log n + 1 ± o(1) and 〈1, v1〉 = √ n ( 1−Θ ( 1 logn )) . It shows a limitation of the existing method ...