Graph Comparison Using Fine Structure Analysis

We introduce a novel technique for comparing graphs using the structure of their subgraphs, which we call a graph´s fine structure. Our technique compares graphs using the earth mover´s distance between the distributions of summarizing features of their constituent subgraphs. We demonstrate the use of this technique as an abstraction of graph edit-distance and show its use in hierarchical clustering on several graphs derived from a variety of sources including social interaction data.