Core stratification of two-mode networks

Abstract

We propose and experiment a new edge decomposition scheme called stratification. It relies on the notion of core subgraphs and may be used with various core definitions, including two-parameters core definitions when exploring two-mode networks. In the two-parameters case the core subgraphs are partially ordered and stratification relies then in finding a sequence of (totally) ordered subgraphs. The main purpose is to help visualizing a large graph by first extracting its densest part, then removing the corresponding edges and then look again at the densest part of the remaining graph and so on. We present experiments on stratification of a two-mode epistemological network.