A graph clustering technique based on discrete Morse theory

Graph clustering is an important area of cluster analysis with wide applications in social networks, data transformation and bioinformatics. The purpose of this paper is to propose a new method in graph clustering, the discrete Morse technique. We propose a new optimization outline using Morse theory, describe graph clustering into simplicial complex, and present an algorithm to construct the discrete vector fields. An example show the work procedure of the proposed method.