October 27, 2017
Similar papers 3
June 25, 2021
Ecological networks such as plant-pollinator systems and food webs vary in space and time. This variability includes fluctuations in global network properties such as total number and intensity of interactions but also in the local properties of individual nodes such as the number and intensity of species-level interactions. Fluctuations of species properties can significantly affect higher-order network features, e.g. robustness and nestedness. Local fluctuations should ther...
July 8, 2016
Bipartite networks are currently regarded as providing a major insight into the organization of many real-world systems, unveiling the mechanisms driving the interactions occurring between distinct groups of nodes. One of the most important issues encountered when modeling bipartite networks is devising a way to obtain a (monopartite) projection on the layer of interest, which preserves as much as possible the information encoded into the original bipartite structure. In the ...
March 21, 2016
Numerical analysis of data from international trade and ecological networks has shown that the non-linear fitness-complexity metric is the best candidate to rank nodes by importance in bipartite networks that exhibit a nested structure. Despite its relevance for real networks, the mathematical properties of the metric and its variants remain largely unexplored. Here, we perform an analytic and numeric study of the fitness-complexity metric and a new variant, called minimal ex...
January 17, 2012
Ecological systems have a high level of complexity combined with stability and rich biodiversity. Recently, the analysis of their properties and evolution has been pushed forward on a basis of concept of mutualistic networks that provides a detailed understanding of their features being linked to a high nestedness of these networks. It was shown that the nestedness architecture of mutualistic networks of plants and their pollinators minimizes competition and increases biodive...
July 20, 2012
This article proposes a method to quantify the structure of a bipartite graph using a network entropy per link. The network entropy of a bipartite graph with random links is calculated both numerically and theoretically. As an application of the proposed method to analyze collective behavior, the affairs in which participants quote and trade in the foreign exchange market are quantified. The network entropy per link is found to correspond to the macroeconomic situation. A fin...
November 8, 2017
Mutualistic interactions, which are beneficial for both interacting species, are recurrently present in ecosystems. Observations of natural systems showed that, if we draw mutualistic relationships as binary links between species, the resulting bipartite network of interactions displays a widespread particular ordering called nestedness. On the other hand, theoretical works have shown that a nested structure has a positive impact on a number of relevant features ranging from ...
April 11, 2023
Networks are a convenient way to represent many interactions among different entities as they provide an efficient and clear methodology to evaluate and organize relevant data. While there are many features for characterizing networks there is a quantity that seems rather elusive: Complexity. The quantification of the complexity of networks is nowadays a fundamental problem. Here, we present a novel tool for identifying the complexity of ecological networks. We compare the be...
September 27, 2023
In this perspective, we introduce recent research into the structure and function of complex investor networks supporting sustainability efforts. Using the case of solar, wind and hydro energy technologies, this perspective explores the complexity in low-carbon finance markets, defined as markets that direct capital flows towards low-carbon technologies, using network approaches to study their structure and dynamics. Investors are modeled as nodes which form a network or high...
June 25, 2024
This paper introduces a method based on a non-linear iterative map to evaluate node relevance in bipartite networks. By tuning a single parameter gamma, the method captures different concepts of node importance, including established measures like degree centrality, eigenvector centrality and the fitness-complexity ranking used in economics. The algorithm's flexibility allows for efficient ranking optimization tailored to specific tasks. As an illustrative example, we apply t...
July 12, 2018
The need to harmonise apparently irreconcilable arrangements in an ecosystem --nestedness and segregation-- has triggered so far different strategies. Methodological refinements, or the inclusion of behavioural preferences to the network dynamics offer a limited approach to the problem, since one remains constrained within a 2-dimensional view of an ecosystem, i.e. a presence-absence matrix. Here we question this partial-view paradigm, and show that nestedness and segregation...