Header

UZH-Logo

Maintenance Infos

Nestedness Maximization in Complex Networks through the Fitness-Complexity Algorithm


Lin, Jian-Hong; Tessone, Claudio; Mariani, Manuel (2018). Nestedness Maximization in Complex Networks through the Fitness-Complexity Algorithm. Entropy, 20(10):768.

Abstract

Nestedness refers to the structural property of complex networks that the neighborhood of a given node is a subset of the neighborhoods of better-connected nodes. Following the seminal work by Patterson and Atmar (1986), ecologists have been long interested in revealing the configuration of maximal nestedness of spatial and interaction matrices of ecological communities. In ecology, the BINMATNEST genetic algorithm can be considered as the state-of-the-art approach for this task. On the other hand, the fitness-complexity ranking algorithm has been recently introduced in the economic complexity literature with the original goal to rank countries and products in World Trade export networks. Here, by bringing together quantitative methods from ecology and economic complexity, we show that the fitness-complexity algorithm is highly effective in the nestedness maximization task. More specifically, it generates matrices that are more nested than the optimal ones by BINMATNEST for 61.27% of the analyzed mutualistic networks. Our findings on ecological and World Trade data suggest that beyond its applications in economic complexity, the fitness-complexity algorithm has the potential to become a standard tool in nestedness analysis.

Abstract

Nestedness refers to the structural property of complex networks that the neighborhood of a given node is a subset of the neighborhoods of better-connected nodes. Following the seminal work by Patterson and Atmar (1986), ecologists have been long interested in revealing the configuration of maximal nestedness of spatial and interaction matrices of ecological communities. In ecology, the BINMATNEST genetic algorithm can be considered as the state-of-the-art approach for this task. On the other hand, the fitness-complexity ranking algorithm has been recently introduced in the economic complexity literature with the original goal to rank countries and products in World Trade export networks. Here, by bringing together quantitative methods from ecology and economic complexity, we show that the fitness-complexity algorithm is highly effective in the nestedness maximization task. More specifically, it generates matrices that are more nested than the optimal ones by BINMATNEST for 61.27% of the analyzed mutualistic networks. Our findings on ecological and World Trade data suggest that beyond its applications in economic complexity, the fitness-complexity algorithm has the potential to become a standard tool in nestedness analysis.

Statistics

Citations

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:03 Faculty of Economics > Department of Business Administration
08 Research Priority Programs > Social Networks
Dewey Decimal Classification:330 Economics
Language:English
Date:8 October 2018
Deposited On:22 Feb 2019 11:04
Last Modified:25 Sep 2019 00:18
Publisher:MDPI Publishing
ISSN:1099-4300
OA Status:Closed
Free access at:Publisher DOI. An embargo period may apply.
Official URL:https://www.mdpi.com/1099-4300/20/10/768/htm
Other Identification Number:merlin-id:16884

Download

Full text not available from this repository.
Get full-text in a library