Core Stratification of Two-Mode Networks

  • Henry SoldanoEmail author
  • Sophie Bary
  • Guillaume Santini
  • Dominique Bouthinon
Conference paper
Part of the Studies in Computational Intelligence book series (SCI, volume 812)


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.


Edge decomposition Generalized cores Two-mode networks 


  1. 1.
    Ahn, Y.Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466(7307), 761–764 (2010)Google Scholar
  2. 2.
    Bary, S.: Scientific representations of biodiversity in the deep-sea: an epistemologic and scientific approach. Ph.D. thesis, Ecole Doctorale 474, Sorbonne Paris Cité (2018)Google Scholar
  3. 3.
    Batagelj, V., Zaversnik, M.: Fast algorithms for determining (generalized) core groups in social networks. Adv. Data Anal. Classif. 5(2), 129–145 (2011)Google Scholar
  4. 4.
    Bouchet, P., Bary, S., Héros, V., Marani, G.: How many species of molluscs are there in the world’s oceans, and who is going to describe them? In tropical Deep-Sea Benthos 29. Mémoires du Muséum national d’Histoire Naturelle 1993(208), 9–24 (2016)Google Scholar
  5. 5.
    Cerinsek, M., Batagelj, V.: Generalized two-mode cores. Soc. Netw. 42, 80–87 (2015)Google Scholar
  6. 6.
    Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of web communities. In: KDD, pp. 150–160. ACM, New York (2000)Google Scholar
  7. 7.
    Giatsidis, C., Thilikos, D.M., Vazirgiannis, M.: D-cores: measuring collaboration of directed graphs based on degeneracy. Knowl. Inf. Syst. 35(2), 311–343 (2013)Google Scholar
  8. 8.
    Kobourov, S.G.: Force-directed drawing algorithms. In: Handbook of Graph Drawing and Visualization, pp. 383–408. Chapman and Hall/CRC, United Kingdom (2013)Google Scholar
  9. 9.
    Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577–8582 (2006)Google Scholar
  10. 10.
    Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005)Google Scholar
  11. 11.
    Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5, 269–287 (1983)Google Scholar
  12. 12.
    Soldano, H., Santini, G.: Graph abstraction for closed pattern mining in attributed networks. In: Schaub, T., Friedrich, G., O’Sullivan, B. (eds.) European Conference on Artificial Intelligence (ECAI). Frontiers in Artificial Intelligence and Applications, vol. 263, pp. 849–854. IOS Press, Amsterdam (2014)Google Scholar
  13. 13.
    Soldano, H., Santini, G., Bouthinon, D., Lazega, E.: Hub-authority cores and attributed directed network mining. In: 29th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2017, Boston, MA, USA, November 6–8, 2017, pp. 1120–1127. IEEE Computer Society (2017)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Henry Soldano
    • 1
    • 2
    Email author
  • Sophie Bary
    • 2
  • Guillaume Santini
    • 1
  • Dominique Bouthinon
    • 1
  1. 1.Université Paris 13, Sorbonne Paris Cité, LIPN, UMR 7030VilletaneuseFrance
  2. 2.Museum National d’Histoire Naturelle, ISYEB, UMR 7205ParisFrance

Personalised recommendations