This monograph is an intertwined tale of eigenvalues and their use in unlocking a thousand secrets about graphs. The stories will be told --- how the spectrum reveals fundamental properties of a graph, how spectral graph theory links the discrete universe to the continuous one through geometric, analytic and algebraic techniques, and how, through eigenvalues, theory and applications in communications and computer science come together in symbiotic harmony....
A. Lancichinetti, and S. Fortunato. (2009)cite arxiv:0908.1062
Comment: 12 pages, 8 figures. The software to compute the values of our
general normalized mutual information will be soon available at
http://santo.fortunato.googlepages.com/inthepress2.
F. Abel, N. Henze, and D. Krause. Proceeding of the 17th ACM conference on Information and knowledge management, page 1429--1430. New York, NY, USA, ACM, (2008)
P. Symeonidis, A. Nanopoulos, and Y. Manolopoulos. RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems, page 43--50. New York, NY, USA, ACM, (2008)
J. Leskovec, and C. Faloutsos. Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, page 631--636. ACM, (2006)
R. Andersen, F. Chung, and K. Lang. Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, page 475--486. Washington, DC, USA, IEEE Computer Society, (2006)
G. Jeh, and J. Widom. Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, page 538--543. New York, NY, USA, ACM, (2002)
I. Dhillon. KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, page 269--274. New York, NY, USA, ACM Press, (2001)