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.
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)
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.
K. Monostori, R. Finkel, A. Zaslavsky, G. Hodász, and M. Pataki. ICCS '02: Proceedings of the International Conference on Computational Science-Part I, page 51--60. London, UK, Springer-Verlag, (2002)Good overview of chunking methods
Study on different chunking strategies and chunk sizes..
M. Strohmaier, P. Prettenhofer, and M. Lux. Proceedings of the CSKGOI'08 Workshop on Commonsense Knowledge and Goal Oriented Interfaces, held in conjunction with IUI'08, Canary Islands, Spain, (2008)
D. Gruhl, R. Guha, D. Liben-Nowell, and A. Tomkins. WWW '04: Proceedings of the 13th international conference on World Wide Web, page 491--501. New York, NY, USA, ACM, (2004)Very good paper on information diffusion..
K. Monostori, A. Zaslavsky, and H. Schmidt. Proceedings of the 2000 information resources management association international conference on Challenges of information technology management in the 21st century, page 955--957. Hershey, PA, USA, IGI Publishing, (2000)