Conditional equilibrium constants in multicomponent heterogeneous adsorption: The conditional affinity spectrum

The concept of conditional stability constant is extended to the competitive binding of small molecules to heterogeneous surfaces or macromolecules via the introduction of the conditional affinity spectrum (CAS). The CAS describes the distribution of effective binding energies experienced by one complexing agent at a fixed concentration of the rest. We show that, when the multicomponent system can be described in terms of an underlying affinity spectrum [integral equation (IE) approach], the system can always be characterized by means of a CAS. The thermodynamic properties of the CAS and its dependence on the concentration of the rest of components are discussed. In the context of metal/proton competition, analytical expressions for the mean (conditional average affinity) and the variance (conditional heterogeneity) of the CAS as functions of pH are reported and their physical interpretation discussed. Furthermore, we show that the dependence of the CAS variance on pH allows for the analytical determination of the correlation coefficient between the binding energies of the metal and the proton. Nonideal competitive adsorption isotherm and Frumkin isotherms are used to illustrate the results of this work. Finally, the possibility of using CAS when the IE approach does not apply (for instance, when multidentate binding is present) is explored. © 2006 American Institute of Physics.

On an upper bound for the arithmetic self-intersection number of the dualizing sheaf on arithmetic surfaces

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

Coalition formation in a contest game with three heterogeneous players

We analyze the incentives for cooperation of three players differing in their efficiency of effort in a contest game. We concentrate on the non-cooperative bargaining foundation of coalition formation, and therefore, we adopt a two-stage model. In the first stage, individuals form coalitions following a bargaining protocol similar to the one proposed by Gul (1989). Afterwards, coalitions play the contest game of Esteban and Ray (1999) within the resulting coalition structure of the first stage. We find that the grand coalition forms whenever the distribution of the bargaining power in the coalition formation game is equal to the distribution of the relative efficiency of effort. Finally, we use the case of equal bargaining power for all individuals to show that other types of coalition structures may be observed as well.

Intersection Pairing and intersection motive of surfaces

We construct the Chow motive modelling intersection co-homology of a proper surface. We then study its functoriality properties. Using Murre's decompositions of the motive of a desingularization into KÄunneth components [Mr1], we show that such decompositions exist also for the intersection motive.

Pure motives, mixed motives and extensions of motives associated to singular surfaces

We first recall the construction of the Chow motive modelling intersection cohomology of a proper surface X and study its fundamental properties. Using Voevodsky's category of effective geometrical motives, we then study the motive of the exceptional divisor D in a non-singular blow-up of X. If all geometric irreducible components of D are of genus zero, then Voevodsky's formalism allows us to construct certain one-extensions of Chow motives, as canonical subquotients of the motive with compact support of the smooth part of X. Specializing to Hilbert-Blumenthal surfaces, we recover a motivic interpretation of a recent construction of A. Caspar.

Random graphs on surfaces

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, . . . , n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.

A computational and geometric approach to phase resetting curves and surfaces

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

Heterogeneous dynamics, aggregation and the persistence of economic shocks

It has been recently emphasized that, if individuals have heterogeneous dynamics, estimates of shock persistence based on aggregate data are significatively higher than those derived from its disaggregate counterpart. However, a careful examination of the implications of this statement on the various tools routinely employed to measure persistence is missing in the literature. This paper formally examines this issue. We consider a disaggregate linear model with heterogeneous dynamics and compare the values of several measures of persistence across aggregation levels. Interestingly, we show that the average persistence of aggregate shocks, as measured by the impulse response function (IRF) of the aggregate model or by the average of the individual IRFs, is identical on all horizons. This result remains true even in situations where the units are (short-memory) stationary but the aggregate process is long-memory or even nonstationary. In contrast, other popular persistence measures, such as the sum of the autoregressive coefficients or the largest autoregressive root, tend to be higher the higher the aggregation level. We argue, however, that this should be seen more as an undesirable property of these measures than as evidence of different average persistence across aggregation levels. The results are illustrated in an application using U.S. inflation data.

The Multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria

A multiple-partners assignment game with heterogeneous sales and multiunit demands consists of a set of sellers that own a given number of indivisible units of (potentially many different) goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of units. We define a competitive equilibrium for this generalized assignment game and prove its existence by using only linear programming. In particular, we show how to compute equilibrium price vectors from the solutions of the dual linear program associated to the primal linear program defined to find optimal assignments. Using only linear programming tools, we also show (i) that the set of competitive equilibria (pairs of price vectors and assignments) has a Cartesian product structure: each equilibrium price vector is part of a competitive equilibrium with all optimal assignments, and vice versa; (ii) that the set of (restricted) equilibrium price vectors has a natural lattice structure; and (iii) how this structure is translated into the set of agents' utilities that are attainable at equilibrium.

Resource dimensioning aspect of heterogeneous traffic with different service requirements: Integration versus segregation

In this paper, we consider the ATM networks in which the virtual path concept is implemented. The question of how to multiplex two or more diverse traffic classes while providing different quality of service requirements is a very complicated open problem. Two distinct options are available: integration and segregation. In an integration approach all the traffic from different connections are multiplexed onto one VP. This implies that the most restrictive QOS requirements must be applied to all services. Therefore, link utilization will be decreased because unnecessarily stringent QOS is provided to all connections. With the segregation approach the problem can be much simplified if different types of traffic are separated by assigning a VP with dedicated resources (buffers and links). Therefore, resources may not be efficiently utilized because no sharing of bandwidth can take place across the VP. The probability that the bandwidth required by the accepted connections exceeds the capacity of the link is evaluated with the probability of congestion (PC). Since the PC can be expressed as the CLP, we shall simply carry out bandwidth allocation using the PC. We first focus on the influence of some parameters (CLP, bit rate and burstiness) on the capacity required by a VP supporting a single traffic class using the new convolution approach. Numerical results are presented both to compare the required capacity and to observe which conditions under each approach are preferred

Parametrization of spectral surfaces of a class of periodic 5-diagonal matrices

The main result of this work is a parametric description of the spectral surfaces of a class of periodic 5-diagonal matrices, related to the strong moment problem. This class is a self-adjoint twin of the class of CMV matrices. Jointly they form the simplest possible classes of 5-diagonal matrices.

Analysis and Monte Carlo simulations of a model for the spread of infectious diseases in heterogeneous metapopulations

We present a study of the continuous-time equations governing the dynamics of a susceptible infected-susceptible model on heterogeneous metapopulations. These equations have been recently proposed as an alternative formulation for the spread of infectious diseases in metapopulations in a continuous-time framework. Individual-based Monte Carlo simulations of epidemic spread in uncorrelated networks are also performed revealing a good agreement with analytical predictions under the assumption of simultaneous transmission or recovery and migration processes

Continuous-time formulation of reaction-diffusion processes on heterogeneous metapopulations

We present the derivation of the continuous-time equations governing the limit dynamics of discrete-time reaction-diffusion processes defined on heterogeneous metapopulations. We show that, when a rigorous time limit is performed, the lack of an epidemic threshold in the spread of infections is not limited to metapopulations with a scale-free architecture, as it has been predicted from dynamical equations in which reaction and diffusion occur sequentially in time

Equilibrium of drops on inclined hydrophilic surfaces

Why does not gravity make drops slip down the inclined surfaces, e.g., plant leaves? The current explanation is based on the existence of surface inhomogeneities, which cause a sustaining force that pins the contact line. Following this theory, the drop remains in equilibrium until a critical value of the sustaining force is reached. We propose an alternative analysis, from the point of view of energy balance, for the particular case in which the drop leaves a liquid film behind. The critical angle of the inclined surface at which the drop slips down is predicted. This result does not depend explicitly on surface inhomogeneities, but only on the drop size and surface tensions. There is good agreement with experiments for contact angles below 90° where the formation of the film is expected, whereas for greater contact angles great discrepancies arise

Speed of reaction-diffusion fronts in spatially heterogeneous media

The front speed problem for nonuniform reaction rate and diffusion coefficient is studied by using singular perturbation analysis, the geometric approach of Hamilton-Jacobi dynamics, and the local speed approach. Exact and perturbed expressions for the front speed are obtained in the limit of large times. For linear and fractal heterogeneities, the analytic results have been compared with numerical results exhibiting a good agreement. Finally we reach a general expression for the speed of the front in the case of smooth and weak heterogeneities