Search

During the last decades, macroecology has identified broad-scale patterns of abundances and diversity of microbial communities and put forward some potential explanations for them. However, these advances are not paralleled by a full understanding of the dynamical processes behind them. In particular, abundance fluctuations of different species are found to be correlated, both across time and across communities in metagenomic samples. Reproducing such correlations through appropriate population models remains an open challenge. The present paper tackles this problem and points to sparse species interactions as a necessary mechanism to account for them. Specifically, we discuss several possibilities to include interactions in population models and recognize Lotka-Volterra constants as a successful ansatz. For this, we design a Bayesian inference algorithm to extract sets of interaction constants able to reproduce empirical probability distributions of pairwise correlations for diverse biomes. Importantly, the inferred models still reproduce well-known single-species macroecological patterns concerning abundance fluctuations across both species and communities. Endorsed by the agreement with the empirically observed phenomenology, our analyses provide insights into the properties of the networks of microbial interactions, revealing that sparsity is a crucial feature. [ABSTRACT FROM AUTHOR]

Many studies anticipate that carbon capture and sequestration (CCS) will be essential to decarbonizing the U.S. economy. However, prior work has not estimated the time required to develop, approve, and implement a geologic sequestration site in the United States. We generate such an estimate by identifying six clearance points that must be passed before a sequestration site can become operational. For each clearance point (CP), we elicit expert judgments of the time required in the form of probability distributions and then use stochastic simulation to combine and sum the results. We find that, on average, there is a 90% chance that the time required lies between 5.5 and 9.6 y, with an upper bound of 12 y. Even using the most optimistic expert judgements, the lower bound on time is 2.7 y, and the upper bound is 8.3 y. Using the most pessimistic judgements, the lower bound is 3.5 y and the upper bound is 19.2 y. These estimates suggest that strategies must be found to safely accelerate the process. We conclude the paper by discussing seven potential strategies. [ABSTRACT FROM AUTHOR]

Network motifs are often called the building blocks of networks. Analysis of motifs has been found to be an indispensable tool for understanding local network structure, in contrast to measures based on node degree distribution and its functions that primarily address a global network topology. As a result, networks that are similar in terms of global topological properties may differ noticeably at a local level. This phenomenon of the impact of local structure has been recently documented in network fragility analysis and classification. At the same time, many studies of networks still tend to focus on global topological measures, often failing to unveil hidden mechanisms behind vulnerability of real networks and their dynamic response to malfunctions. In this paper, a study of motif-based analysis of network resilience and reliability under various types of intentional attacks is presented, with the goal of shedding light on local dynamics and vulnerability of networks. These methods are demonstrated on electricity transmission networks of 4 European countries, and the results are compared with commonly used resilience and reliability measures. [ABSTRACT FROM AUTHOR]