DENSITY PROFILE, VELOCITY ANISOTROPY, AND LINE-OF-SIGHT EXTERNAL CONVERGENCE OF SLACS GRAVITATIONAL LENSES

Data from 58 strong-lensing events surveyed by the Sloan Lens ACS Survey are used to estimate the projected galaxy mass inside their Einstein radii by two independent methods: stellar dynamics and strong gravitational lensing. We perform a joint analysis of these two estimates inside models with up to three degrees of freedom with respect to the lens density profile, stellar velocity anisotropy, and line-of-sight (LOS) external convergence, which incorporates the effect of the large-scale structure on strong lensing. A Bayesian analysis is employed to estimate the model parameters, evaluate their significance, and compare models. We find that the data favor Jaffe`s light profile over Hernquist`s, but that any particular choice between these two does not change the qualitative conclusions with respect to the features of the system that we investigate. The density profile is compatible with an isothermal, being sightly steeper and having an uncertainty in the logarithmic slope of the order of 5% in models that take into account a prior ignorance on anisotropy and external convergence. We identify a considerable degeneracy between the density profile slope and the anisotropy parameter, which largely increases the uncertainties in the estimates of these parameters, but we encounter no evidence in favor of an anisotropic velocity distribution on average for the whole sample. An LOS external convergence following a prior probability distribution given by cosmology has a small effect on the estimation of the lens density profile, but can increase the dispersion of its value by nearly 40%.

Evolution and coevolution in mutualistic networks

A major current challenge in evolutionary biology is to understand how networks of interacting species shape the coevolutionary process. We combined a model for trait evolution with data for twenty plant-animal assemblages to explore coevolution in mutualistic networks. The results revealed three fundamental aspects of coevolution in species-rich mutualisms. First, coevolution shapes species traits throughout mutualistic networks by speeding up the overall rate of evolution. Second, coevolution results in higher trait complementarity in interacting partners and trait convergence in species in the same trophic level. Third, convergence is higher in the presence of super-generalists, which are species that interact with multiple groups of species. We predict that worldwide shifts in the occurrence of super-generalists will alter how coevolution shapes webs of interacting species. Introduced species such as honeybees will favour trait convergence in invaded communities, whereas the loss of large frugivores will lead to increased trait dissimilarity in tropical ecosystems.

Analysis of a hyper-diverse seed dispersal network: modularity and underlying mechanisms

Mutualistic interactions involving pollination and ant-plant mutualistic networks typically feature tightly linked species grouped in modules. However, such modularity is infrequent in seed dispersal networks, presumably because research on those networks predominantly includes a single taxonomic animal group (e.g. birds). Herein, for the first time, we examine the pattern of interaction in a network that includes multiple taxonomic groups of seed dispersers, and the mechanisms underlying modularity. We found that the network was nested and modular, with five distinguishable modules. Our examination of the mechanisms underlying such modularity showed that plant and animal trait values were associated with specific modules but phylogenetic effect was limited. Thus, the pattern of interaction in this network is only partially explained by shared evolutionary history. We conclude that the observed modularity emerged by a combination of phylogenetic history and trait convergence of phylogenetically unrelated species, shaped by interactions with particular types of dispersal agents.

Outer Trust-Region Method for Constrained Optimization

Given an algorithm A for solving some mathematical problem based on the iterative solution of simpler subproblems, an outer trust-region (OTR) modification of A is the result of adding a trust-region constraint to each subproblem. The trust-region size is adaptively updated according to the behavior of crucial variables. The new subproblems should not be more complex than the original ones, and the convergence properties of the OTR algorithm should be the same as those of Algorithm A. In the present work, the OTR approach is exploited in connection with the ""greediness phenomenon"" of nonlinear programming. Convergence results for an OTR version of an augmented Lagrangian method for nonconvex constrained optimization are proved, and numerical experiments are presented.