A robust graph partition method from the path-weighted adjacency matrix

Abstract

In this paper we develop a new graph representation based on the path-weighted adjacency matrix for characterising global graph structure. The representation is derived from the heat-kernel of the graph. We investigate whether the path-weighted adjacency matrix can be used for the problem of graph partitioning. Here we demonstrate that the method out-performs the use of the adjacency matrix. The main advantage of the new method is that it both preserves partition consistency and shows improved stability to structural error. © Springer-Verlag Berlin Heidelberg 2005.