Publication: Nestedness maximization in complex networks through the fitness-complexity algorithm
Nestedness maximization in complex networks through the fitness-complexity algorithm
Date
Date
Date
Citations
Lin, J.-H., Tessone, C., & Mariani, M. (2018). Nestedness maximization in complex networks through the fitness-complexity algorithm. Entropy, 20(10), 768–768. https://doi.org/10.3390/e20100768
Abstract
Abstract
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 algor
Metrics
Downloads
Views
Additional indexing
Creators (Authors)
- Lin, Jian-Hong
Volume
Volume
Volume
Number
Number
Number
Page range/Item number
Page range/Item number
Page range/Item number
Page end
Page end
Page end
Item Type
Item Type
Item Type
Scope
Scope
Scope
Language
Language
Language
Publication date
Publication date
Publication date
Date available
Date available
Date available
ISSN or e-ISSN
ISSN or e-ISSN
ISSN or e-ISSN
OA Status
OA Status
OA Status
Free Access at
Free Access at
Free Access at
Publisher DOI
Other Identification Number
Other Identification Number
Other Identification Number
Metrics
Downloads
Views
Citations
Lin, J.-H., Tessone, C., & Mariani, M. (2018). Nestedness maximization in complex networks through the fitness-complexity algorithm. Entropy, 20(10), 768–768. https://doi.org/10.3390/e20100768
