Genetic diversity and species richness patterns in Baetidae (Ephemeroptera) in the Montseny Mountain range (North-East Iberian Peninsula)

This study aimed to describe patterns of diversity of Baetidae (Ephemeroptera) at the ommunity and population levels within the Montseny Mountain range (North-East Iberian Peninsula). We studied both the distribution of 4 species of baetids in 20 sites among three catchments along the altitudinal gradient (350-1700 masl); and the genetic diversity of the mtDNA cytochrome c oxidase subunit I (cox1) gene of the two common species Baetis alpinus and Baetis rhodani. We found a gradual replacement of the dominant species along the altitudinal gradient. Baetis alpinus inhabited sites at high-altitudes, and this species was replaced by B. rhodani when the altitude decreased. Baetis melanonyx and Alainites muticus attained low abundance at all river sections, and no clear altitudinal trend appeared. Our hypothesis at the population level was that genetic structuring is associated with geographic distance and limited by drainage boundaries among the three studied catchments because of the short-time dispersion of adults. Unexpectedly, analyses of molecular variance (AMOVA) and isolation-bydistance (IBD) showed genetic diversity was unstructured by distance for both species, which may be explained by the relatively short spatial scale studied and small topographic barriers among the three catchments. The Generalized Mixed Yule-Coalescent (GMYC) model showed that B. rhodani had two differentiated genetic lineages that co-occurred in all sites. Overall, diversity of baetids was structured at the community level along the altitudinal gradient, whereas it was unstructured at the population level within the Montseny Mountain range.

Genetic diversity and species richness patterns in Baetidae (Ephemeroptera) in the Montseny Mountain range (North-East Iberian Peninsula)

This study aimed to describe patterns of diversity of Baetidae (Ephemeroptera) at the ommunity and population levels within the Montseny Mountain range (North-East Iberian Peninsula). We studied both the distribution of 4 species of baetids in 20 sites among three catchments along the altitudinal gradient (350-1700 masl); and the genetic diversity of the mtDNA cytochrome c oxidase subunit I (cox1) gene of the two common species Baetis alpinus and Baetis rhodani. We found a gradual replacement of the dominant species along the altitudinal gradient. Baetis alpinus inhabited sites at high-altitudes, and this species was replaced by B. rhodani when the altitude decreased. Baetis melanonyx and Alainites muticus attained low abundance at all river sections, and no clear altitudinal trend appeared. Our hypothesis at the population level was that genetic structuring is associated with geographic distance and limited by drainage boundaries among the three studied catchments because of the short-time dispersion of adults. Unexpectedly, analyses of molecular variance (AMOVA) and isolation-bydistance (IBD) showed genetic diversity was unstructured by distance for both species, which may be explained by the relatively short spatial scale studied and small topographic barriers among the three catchments. The Generalized Mixed Yule-Coalescent (GMYC) model showed that B. rhodani had two differentiated genetic lineages that co-occurred in all sites. Overall, diversity of baetids was structured at the community level along the altitudinal gradient, whereas it was unstructured at the population level within the Montseny Mountain range.

The period function of the generalized Lotka-Volterra centers

"Vegeu el resum a l'inici del document del fitxer adjunt"

Can genetic algorithms explain experimental anomalies? An application to common property resources

It is common to find in experimental data persistent oscillations in the aggregate outcomes and high levels of heterogeneity in individual behavior. Furthermore, it is not unusual to find significant deviations from aggregate Nash equilibrium predictions. In this paper, we employ an evolutionary model with boundedly rational agents to explain these findings. We use data from common property resource experiments (Casari and Plott, 2003). Instead of positing individual-specific utility functions, we model decision makers as selfish and identical. Agent interaction is simulated using an individual learning genetic algorithm, where agents have constraints in their working memory, a limited ability to maximize, and experiment with new strategies. We show that the model replicates most of the patterns that can be found in common property resource experiments.

A generalized assignment game

The proposed game is a natural extension of the Shapley and Shubik Assignment Game to the case where each seller owns a set of different objets instead of only one indivisible object. We propose definitions of pairwise stability and group stability that are adapted to our framework. Existence of both pairwise and group stable outcomes is proved. We study the structure of the group stable set and we finally prove that the set of group stable payoffs forms a complete lattice with one optimal group stable payoff for each side of the market.

In whose backyard? A generalized bidding approach

We analyze situations in which a group of agents (and possibly a designer) have to reach a decision that will affect all the agents. Examples of such scenarios are the location of a nuclear reactor or the siting of a major sport event. To address the problem of reaching a decision, we propose a one-stage multi-bidding mechanism where agents compete for the project by submitting bids. All Nash equilibria of this mechanism are efficient. Moreover, the payoffs attained in equilibrium by the agents satisfy intuitively appealing lower bounds..

Generalized property R and the Schoenflies Conjecture

There is a relation between the generalized Property R Conjecture and the Schoenflies Conjecture that suggests a new line of attack on the latter. The new approach gives a quick proof of the genus 2 Schoenflies Conjecture and suffices to prove the genus 3 case, even in the absence of new progress on the generalized Property R Conjecture.

Generalized backward doubly stochastic differential equations and SPDEs with nonlinear Neumann boundary conditions

In this paper, a new class of generalized backward doubly stochastic differential equations is investigated. This class involves an integral with respect to an adapted continuous increasing process. A probabilistic representation for viscosity solutions of semi-linear stochastic partial differential equations with a Neumann boundary condition is given.

Generating trees for permutations avoiding generalized patterns

We construct generating trees with with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation, which allows us to incorporate the adjacency condition about some entries in an occurrence of a generalized pattern. We use these trees to find functional equations for the generating functions enumerating these classes of permutations with respect to different parameters. In several cases we solve them using the kernel method and some ideas of Bousquet-Mélou [2]. We obtain refinements of known enumerative results and find new ones.

Generalized factor models: a bayesian approach

There is recent interest in the generalization of classical factor models in which the idiosyncratic factors are assumed to be orthogonal and there are identification restrictions on cross-sectional and time dimensions. In this study, we describe and implement a Bayesian approach to generalized factor models. A flexible framework is developed to determine the variations attributed to common and idiosyncratic factors. We also propose a unique methodology to select the (generalized) factor model that best fits a given set of data. Applying the proposed methodology to the simulated data and the foreign exchange rate data, we provide a comparative analysis between the classical and generalized factor models. We find that when there is a shift from classical to generalized, there are significant changes in the estimates of the structures of the covariance and correlation matrices while there are less dramatic changes in the estimates of the factor loadings and the variation attributed to common factors.

A Model-to-model analysis of the repeated Prisoners' Dilemma: genetic algorithms vs. evolutionary dynamics

We study the properties of the well known Replicator Dynamics when applied to a finitely repeated version of the Prisoners' Dilemma game. We characterize the behavior of such dynamics under strongly simplifying assumptions (i.e. only 3 strategies are available) and show that the basin of attraction of defection shrinks as the number of repetitions increases. After discussing the difficulties involved in trying to relax the 'strongly simplifying assumptions' above, we approach the same model by means of simulations based on genetic algorithms. The resulting simulations describe a behavior of the system very close to the one predicted by the replicator dynamics without imposing any of the assumptions of the analytical model. Our main conclusion is that analytical and computational models are good complements for research in social sciences. Indeed, while on the one hand computational models are extremely useful to extend the scope of the analysis to complex scenar

Generalized multiresolution analyses with given multiplicity functions

Generalized multiresolution analyses are increasing sequences of subspaces of a Hilbert space H that fail to be multiresolution analyses in the sense of wavelet theory because the core subspace does not have an orthonormal basis generated by a fixed scaling function. Previous authors have studied a multiplicity function m which, loosely speaking, measures the failure of the GMRA to be an MRA. When the Hilbert space H is L2(Rn), the possible multiplicity functions have been characterized by Baggett and Merrill. Here we start with a function m satisfying a consistency condition which is known to be necessary, and build a GMRA in an abstract Hilbert space with multiplicity function m.

A numerical algorithm for finding solutions of a generalized Nash equilibrium problem

A family of nonempty closed convex sets is built by using the data of the Generalized Nash equilibrium problem (GNEP). The sets are selected iteratively such that the intersection of the selected sets contains solutions of the GNEP. The algorithm introduced by Iusem-Sosa (2003) is adapted to obtain solutions of the GNEP. Finally some numerical experiments are given to illustrate the numerical behavior of the algorithm.

On Cooperative solutions of a generalized assignment game: limit theorems to the set of competitive equilibria

We study two cooperative solutions of a market with indivisible goods modeled as a generalized assignment game: Set-wise stability and Core. We first establish that the Set-wise stable set is contained in the Core and it contains the non-empty set of competitive equilibrium payoffs. We then state and prove three limit results for replicated markets. First, the sequence of Cores of replicated markets converges to the set of competitive equilibrium payoffs when the number of replicas tends to infinity. Second, the Set-wise stable set of a two-fold replicated market already coincides with the set of competitive equilibrium payoffs. Third, for any number of replicas there is a market with a Core payoff that is not a competitive equilibrium payoff.

Generalized inductive limits of quasidiagonal C*-algebras

If A is a unital quasidiagonal C*-algebra, we construct a generalized inductive limit BA which is simple, unital and inherits many structural properties from A. If A is the unitization of a non-simple purely infinite algebra (e.g., the cone over a Cuntz algebra), then BA is tracially AF which, among other things, lends support to a conjecture of Toms.