Kernelising the Ihara Zeta Function

摘要

The Ihara Zeta Function, related to the number of prime cycles in a graph, is a powerful tool for graph clustering and characterization. In this paper we explore how to use the Ihara Zeta Function to define graph kernels. We propose to use the coefficients of reciprocal of Ihara Zeta Function for defining a kernel. The proposed kernel is then applied to graph clustering.