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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We use the implementation by Jorge C. Valverde-Rebaza to be found at http://www.labic.icmc.usp.br/jvalverr/
References
Ahn, Y.Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466(7307), 761–764 (2010)
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)
Batagelj, V., Zaversnik, M.: Fast algorithms for determining (generalized) core groups in social networks. Adv. Data Anal. Classif. 5(2), 129–145 (2011)
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)
Cerinsek, M., Batagelj, V.: Generalized two-mode cores. Soc. Netw. 42, 80–87 (2015)
Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of web communities. In: KDD, pp. 150–160. ACM, New York (2000)
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)
Kobourov, S.G.: Force-directed drawing algorithms. In: Handbook of Graph Drawing and Visualization, pp. 383–408. Chapman and Hall/CRC, United Kingdom (2013)
Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577–8582 (2006)
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)
Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5, 269–287 (1983)
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)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Soldano, H., Bary, S., Santini, G., Bouthinon, D. (2019). Core Stratification of Two-Mode Networks. In: Aiello, L., Cherifi, C., Cherifi, H., Lambiotte, R., Lió, P., Rocha, L. (eds) Complex Networks and Their Applications VII. COMPLEX NETWORKS 2018. Studies in Computational Intelligence, vol 812. Springer, Cham. https://doi.org/10.1007/978-3-030-05411-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-05411-3_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05410-6
Online ISBN: 978-3-030-05411-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)