Two new types of visualization for mutualistic communities based in k-core decomposition

García Algarra, Francisco Javier; Galeano, Javier y Pastor Ruiz, Juan Manuel (2015). Two new types of visualization for mutualistic communities based in k-core decomposition. "International Journal of Complex Systems in Science", v. 5 (n. 1); pp. 19-23. ISSN 2174-6036.

Descripción

Título: Two new types of visualization for mutualistic communities based in k-core decomposition
Autor/es:
  • García Algarra, Francisco Javier
  • Galeano, Javier
  • Pastor Ruiz, Juan Manuel
Tipo de Documento: Artículo
Título de Revista/Publicación: International Journal of Complex Systems in Science
Fecha: Septiembre 2015
Volumen: 5
Materias:
Escuela: E.T.S.I. Agrónomos (UPM) [antigua denominación]
Departamento: Otro
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (349kB) | Vista Previa

Resumen

The bipartite graph is the most popular visualization of mutualistic networks. This plot underlines the existence of two guilds of nodes. Links between them are di?cult to follow even with a reduced number of elements, and it is almost impossible to discover organizational patterns. As a result, it is uncommon ?nding graphs of big bipartite networks in the literature. These shortcomings are even worse for networks with real time, strongly non linear interactions, such as mutualistic newtorks. Their internal structure is very important to understand their behaviour and resilience. For instance, it is quite important to know how central is a node and how its removal may trigger a cascade extinction [1]. We have developped two new kinds of visualization, polar and ziggurat plots, based on k-core decomposition. The idea was succesfully applied to very large networks [3] to reduce the ammount of displayed information. Our solution does not reduce information, as mutualistic networks have less than 1000 nodes. Instead, the decomposition discovers an internal organization that has its roots in topological properties.

Más información

ID de Registro: 43609
Identificador DC: http://oa.upm.es/43609/
Identificador OAI: oai:oa.upm.es:43609
URL Oficial: http://www.ij-css.org/current.html
Depositado por: Memoria Investigacion
Depositado el: 24 Oct 2016 17:23
Ultima Modificación: 24 Oct 2016 17:23
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM