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.
D. Kempe, J. Kleinberg, and E. Tardos. KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, page 137--146. ACM Press, (2003)
D. Watts. Proceedings of the National Academy of Sciences of the United States of America, 99, page 5766--5771. (April 2002)http://www.jstor.org/view/00278424/sp020038/02x3936j/0.
W. Kienreich, M. Granitzer, V. Sabol, and W. Klieber. DEXA '06: Proceedings of the 17th International Conference on Database and Expert Systems Applications, page 181--188. Washington, DC, USA, IEEE Computer Society, (2006)
Q. Mei, C. Liu, H. Su, and C. Zhai. WWW '06: Proceedings of the 15th international conference on World Wide Web, page 533--542. New York, NY, USA, ACM Press, (2006)
J. Leskovec, L. Adamic, and B. Huberman. EC '06: Proceedings of the 7th ACM conference on Electronic commerce, page 228--237. New York, NY, USA, ACM, (2006)