In this paper we make a characteristic polynomial analysis on hypergraphs for the purpose of clustering. Our starting point is the Ihara zeta function [8] which captures the cycle structure for hypergraphs. The Ihara zeta function for a hypergraph can be expressed in a determinant form as the reciprocal of the characteristic polynomial of the adjacency matrix for a transformed graph representation. Our hypergraph characterization is based on the coefficients of the characteristic polynomial, and can be used to construct feature vectors for hypergraphs. In the experimental evaluation, we demonstrate the effectiveness of the proposed characterization for clustering hypergraphs. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Ren, P., Aleksić, T., Wilson, R. C., & Hancock, E. R. (2009). Hypergraphs, characteristic polynomials and the ihara zeta function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5702 LNCS, pp. 369–376). https://doi.org/10.1007/978-3-642-03767-2_45
Mendeley helps you to discover research relevant for your work.