Event time:
Tuesday, April 29, 2014 - 12:00pm to 1:00pm
Location:
AKW 200
Speaker:
Alex Cloninger
Speaker affiliation:
University of Maryland
Event description:
We aim to understand and characterize embeddings from the Laplacian Eigenmaps algorithm in the case of small, anomalous clusters. To do this, we characterize the order in which eigenvectors of a disjoint graph emerge and the support of those eigenvectors. We then extend this characterization to weakly connected graphs with clusters of differing sizes, utilizing the theory of invariant subspace perturbations and proving some novel results.