One can gain a lot of insight into the structure of a network by analzing the eigenvalues and eigenvectors of its adjacency matrix. The connection between spectral parameters and the more combinatorial properties of networks and datasets is a subtle issue, and while many results have been established about this connection, it is still not fully understood. This connection has also led to a number of applications, including the development of link analysis algorithms for Web search.
S. Shankar, G. Rajendra, K. Ashok, and G. Nanaso. International Journal on Recent and Innovation Trends in Computing and Communication, 3 (3):
1361--1366(March 2015)
E. Bakshy, J. Hofman, W. Mason, and D. Watts. Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, page 65--74. New York, NY, USA, ACM, (2011)
H. Kwak, C. Lee, H. Park, and S. Moon. Proceedings of the 19th international conference on World wide web, page 591--600. New York, NY, USA, ACM, (2010)
H. Kwak, C. Lee, H. Park, and S. Moon. WWW '10: Proceedings of the 19th international conference on World wide web, page 591--600. New York, NY, USA, ACM, (2010)