Descripción
|
|
---|---|
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 difficult to follow even with a reduced number of elements, and it is almost impossible to discover organizational patterns. As a result, it is uncommon finding 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. 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 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. | |
Internacional
|
Si |
JCR del ISI
|
No |
Título de la revista
|
International Journal of Complex Systems in Science |
ISSN
|
2174-6036 |
Factor de impacto JCR
|
|
Información de impacto
|
|
Volumen
|
5 |
DOI
|
|
Número de revista
|
1 |
Desde la página
|
19 |
Hasta la página
|
23 |
Mes
|
SEPTIEMBRE |
Ranking
|