What we miss in network analysis

22 November 2016

The analysis of relational data from a graph or network perspective has become a cornerstone of data mining. However, for data sets where additional information like, e.g. the timing or ordering of relations are available, in a number of recent works we have shown that the network perspective can yield wrong results. In our latest work published in the European Physical Journal B we now offer a solution, namely the analysis of higher-order networks. We specifically show that this promising abstraction allows us to (i) generalize common path-based centrality measures to higher-order centralities, and that (ii) these higher-order measures better capture the real importance of nodes in time-evolving network topologies.