Before revision:  We illustrate its strengths on challenging classification problems on dynamical systems orbit or real-life graph data, with results improving or comparable to the state-of-the-art. In order to exploit topological information from graph data, we show how graph structures can be encoded in the so-called extended persistence diagrams computed with the heat kernel signatures of the graphs .
After revision:  We illustrate its strengths on challenging classification problems on dynamical systems orbit or real-life graph datasets .