Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models

作者：Kajdanowicz Tomasz; Morzy Mikolaj

来源：Entropy, 2016, 18(9): 320.

DOI：10.3390/e18090320

• graph
• entropy
• similarity
• Kolmogorov-Smirnov test

Over the years, several theoretical graph generation models have been proposed. Among the most prominent are: the Erdos-Renyi random graph model, Watts-Strogatz small world model, Albert-Barabasi preferential attachment model, Price citation model, and many more. Often, researchers working with real-world data are interested in understanding the generative phenomena underlying their empirical graphs. They want to know which of the theoretical graph generation models would most probably generate a particular empirical graph. In other words, they expect some similarity assessment between the empirical graph and graphs artificially created from theoretical graph generation models. Usually, in order to assess the similarity of two graphs, centrality measure distributions are compared. For a theoretical graph model this means comparing the empirical graph to a single realization of a theoretical graph model, where the realization is generated from the given model using an arbitrary set of parameters. The similarity between centrality measure distributions can be measured using standard statistical tests, e.g., the Kolmogorov-Smirnov test of distances between cumulative distributions. However, this approach is both error-prone and leads to incorrect conclusions, as we show in our experiments. Therefore, we propose a new method for graph comparison and type classification by comparing the entropies of centrality measure distributions (degree centrality, betweenness centrality, closeness centrality). We demonstrate that our approach can help assign the empirical graph to the most similar theoretical model using a simple unsupervised learning method.

• 出版日期2016-9