A Transport Redundancy Approach to Spatial Clustering

Abstract

In this thesis, we consider a new random walks-based method for measuring clustering on finite graphs. The method is versatile and can provide valuable insight into the locations of centers of clusters and outliers. Some results and applications are discussed.