Graph clustering

Abstract

The goal of the thesis is the study of graphs emphasizing on laplacian matrices and spectral clustering. The first chapter constitutes an introduction to graphs. In the second chapter we introduce laplacian matrices, while in the third chapter we represent some of the most ubiquitous spectral clustering algorithms. The application of the thesis is clustering of bond yield data. In the appendix we cite some code for the clustering of bond yield data.