Core Stratification of Two-Mode Networks

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.

[1]  C. Lee Giles,et al.  Efficient identification of Web communities , 2000, KDD '00.

[2]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Henry Soldano,et al.  Hub-Authority Cores and Attributed Directed Network Mining , 2017, 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI).

[4]  Vladimir Batagelj,et al.  Generalized two-mode cores , 2015, Soc. Networks.

[5]  Sune Lehmann,et al.  Link communities reveal multiscale complexity in networks , 2009, Nature.

[6]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[7]  Henry Soldano,et al.  Graph abstraction for closed pattern mining in attributed networks , 2014, ECAI.

[8]  Vladimir Batagelj,et al.  Fast algorithms for determining (generalized) core groups in social networks , 2011, Adv. Data Anal. Classif..

[9]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .