CSH intern Emanuele Calò will present his project results on Friday, June 24 at 3 pm in room 201.
Title: “Economic Complexity Algorithms in Complex Networks: Applications to Economics and Ecology”
Economic Complexity (EC) algorithms estimate the fitness and complexity of the nodes of bipartite networks. Typical examples are the network of countries and their exported products or the network of countries and the fields of scientific production. These algorithms cease to work as soon as the network is not bipartite anymore, even if there is only one “weak” link between two nodes of the same class.
Our task has been to generalize EC algorithms to deal with non-bipartite networks. We first analyze the linear Economic Complexity Index (ECI) method and then the non-linear Economic Fitness Complexity (EFC), showing that the latter is more stable after introducing small non-bipartite perturbations. Eventually, we use EFC to study the complexity of the prey-predator ecosystem in Florida Bay.
We recommend this seminar to all our colleagues who deal with those systems where it is essential to estimate the importance of the actors involved, not necessarily systems in economics.