Snailvis: a paradigm to visualize complex networks

BEIRÓ, MARIANO G.; BUSCH, JORGE R.; ALVAREZ HAMELIN, JOSÉ IGNACIO

Buenos Aires

Simposio; 39 Jornadas Argentinas de Inform\'atica e Investigación Operativa-Argentine Symposium on Computing Technology (JAIIO-AST '10); 2010

SADIO

We propose a new non-parametric and linear-complexity algorithm to visualize complex networks, which were previously decomposed in subsets according to some criteria. We show two representations: the first including all edges and vertices and the second, summarized, highlighting subsets and their relations. In this paper we use a community decomposition algorithm to generate the subsets; then we rank them by the number of inter-community connections. We also highlight the central core of each community, that is, the subset with the highest connectivity level, which is the kmax -core of the k-core decomposition.