Nestedness Maximization in Complex Networks through the Fitness-Complexity Algorithm
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...
Main Authors: | Jian-Hong Lin, Claudio Juan Tessone, Manuel Sebastian Mariani |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-10-01
|
Series: | Entropy |
Subjects: | |
Online Access: | http://www.mdpi.com/1099-4300/20/10/768 |
Similar Items
-
Complexity of Products: The Effect of Data Regularisation
by: Orazio Angelini, et al.
Published: (2018-10-01) -
Equivalence between the Fitness-Complexity and the Sinkhorn-Knopp algorithms
by: D Mazzilli, et al.
Published: (2024-01-01) -
The different structure of economic ecosystems at the scales of companies and countries
by: Dario Laudati, et al.
Published: (2023-01-01) -
Which Matrices Show Perfect Nestedness or the Absence of Nestedness? An Analytical Study on the Performance of NODF and WNODF
by: Nicholas Britton, et al.
Published: (2016-01-01) -
The shortlist effect: nestedness contributions as a tool to explain cultural success
by: Olivier Morin, et al.
Published: (2021-01-01)