The complexity of random ordered structures

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

Testing Cayley graph densities

We present a computer-assisted analysis of combinatorial properties of the Cayley graphs of certain finitely generated groups: Given a group with a finite set of generators, we study the density of the corresponding Cayley graph, that is, the least upper bound for the average vertex degree (= number of adjacent edges) of any finite subgraph. It is known that an m-generated group is amenable if and only if the density of the corresponding Cayley graph equals to 2m. We test amenable and non-amenable groups, and also groups for which amenability is unknown. In the latter class we focus on Richard Thompson’s group F.

Optimal monitoring to implement clean technologies when pollution is random

We analyze a model where firms chose a production technology which, together with some random event, determines the final emission level. We consider the coexistence of two alternative technologies: a "clean" technology, and a "dirty" technology. The environmental regulation is based on taxes over reported emissions, and on penalties over unreported emissions. We show that the optimal inspection policy is a cut-off strategy, for several scenarios concerning the observability of the adoption of the clean technology and the cost of adopting it. We also show that the optimal inspection policy induces the firm to adopt the clean technology if the adoption cost is not too high, but the cost levels for which the firm adopts it depend on the scenario.

A class of stochastic games with infinitely many interacting agents related to Glauber dynamics on random graphs

We introduce and study a class of infinite-horizon nonzero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions, the existence of a strategy that allows any player to eliminate losses after a finite random time. In the special case of symmetric interactions, we also prove that, as time goes to infinity, the game converges to a Nash equilibrium. Moreover, assuming that all agents adopt the same strategy, using arguments related to those leading to perfect simulation algorithms, spatial mixing and ergodicity are proved. In turn, ergodicity allows us to prove “fixation”, i.e. that players will adopt a constant strategy after a finite time. The resulting dynamics is related to zerotemperature Glauber dynamics on random graphs of possibly infinite volume.

Statistical properties of subgroups of free groups

The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations are determined) by randomly chosen k-tuples of reduced words, whose maximal length is allowed to tend to infinity. In this paper we adopt a different, though equally natural point of view: we investigate the statistical properties of the same objects, but with respect to the so-called graph-based distribution, recently introduced by Bassino, Nicaud and Weil. Here, subgroups (and finite presentations) are determined by randomly chosen Stallings graphs whose number of vertices tends to infinity. Our results show that these two distributions behave quite differently from each other, shedding a new light on which properties of finitely generated subgroups can be considered frequent or rare. For example, we show that malnormal subgroups of a free group are negligible in the raph-based distribution, while they are exponentially generic in the word-based distribution. Quite surprisingly, a random finite presentation generically presents the trivial group in this new distribution, while in the classical one it is known to generically present an infinite hyperbolic group.

Theoretical aspects of graph models for MANETs

We survey the main theoretical aspects of models for Mobile Ad Hoc Networks (MANETs). We present theoretical characterizations of mobile network structural properties, different dynamic graph models of MANETs, and finally we give detailed summaries of a few selected articles. In particular, we focus on articles dealing with connectivity of mobile networks, and on articles which show that mobility can be used to propagate information between nodes of the network while at the same time maintaining small transmission distances, and thus saving energy.

Spectral analysis of random sparse matrices

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

Propagation connectivity of random hypergraphs

We study the concept of propagation connectivity on random 3-uniform hypergraphs. This concept is inspired by a simple linear time algorithm for solving instances of certain constraint satisfaction problems. We derive upper and lower bounds for the propagation connectivity threshold, and point out some algorithmic implications.

Sequencing and identification of expressed Schistosoma mansoni genes by random selection of cDNA clones from a directional library

We have initiated a gene discovery program in Schistosoma mansoni based on the technique of Expressed Sequence Tags (ESTs), i.e. partial sequences of cDNAs obtained from single passes in automatic DNA sequencers. ESTs can be used to identify genese onf the basis of their homology whith sequences from other species deposited in DNA or protein databases. Trasncripts with sequences without matches in teh databases may represent novel parasite-specific genes. This approach has shown to be very efficient and in less than two years a broad range of novel genes has already been ascertained, more than doubling the number of known S. mansoni genes.

Identification of species related to Anopheles (Nyssorhynchus) albitarsis by random amplified polymorphic DNA-Polymerase chain reaction (Diptera: Culicidae)

Species-specific Random Amplified Polymorphic DNA-Polymerase chain Reaction (RAPD-PCR) markers were used to identify four species related to Anopheles (Nyssorhynchus) albitarsis Lynch-Arribàlzaga from 12 sites in Brazil and 4 in Venezuela. In a previous study (Wilkerson et al. 1995), which included sites in Paraguay and Argentina, these four species were designated "A", "B", "C" and "D". It was hypothesized that species A is An. (Nys.) albitarsis, species B is undescribed, species C is An. (Nys) marajoara Galvão and Damasceno and species D is An. (Nys.) deaneorum Rosa-Freitas. Species D, previously characterized by RAPD-PCR from a small sample from northern Argentina and southern Brazil, is reported here from the type locality of An. (Nys.) deaneorum, Guajará-Mirim, state of Rondônia, Brazil. Species C and D were found by RAPD-PCR to be sympatric at Costa Marques, state of Rondônia, Brazil. Species A and C have yet to be encountered at the same locality. The RAPD markers for species C were found to be conserved over 4,620 km; from Iguape, state of São Paulo, Brazil to rio Socuavo, state of Zulia, Venezuela. RAPD-PCR was determined to be an effective means for the identification of unknown species within this species complex.

White matter maturation reshapes structural connectivity in the late developing human brain.

From toddler to late teenager, the macroscopic pattern of axonal projections in the human brain remains largely unchanged while undergoing dramatic functional modifications that lead to network refinement. These functional modifications are mediated by increasing myelination and changes in axonal diameter and synaptic density, as well as changes in neurochemical mediators. Here we explore the contribution of white matter maturation to the development of connectivity between ages 2 and 18 y using high b-value diffusion MRI tractography and connectivity analysis. We measured changes in connection efficacy as the inverse of the average diffusivity along a fiber tract. We observed significant refinement in specific metrics of network topology, including a significant increase in node strength and efficiency along with a decrease in clustering. Major structural modules and hubs were in place by 2 y of age, and they continued to strengthen their profile during subsequent development. Recording resting-state functional MRI from a subset of subjects, we confirmed a positive correlation between structural and functional connectivity, and in addition observed that this relationship strengthened with age. Continuously increasing integration and decreasing segregation of structural connectivity with age suggests that network refinement mediated by white matter maturation promotes increased global efficiency. In addition, the strengthening of the correlation between structural and functional connectivity with age suggests that white matter connectivity in combination with other factors, such as differential modulation of axonal diameter and myelin thickness, that are partially captured by inverse average diffusivity, play an increasingly important role in creating brain-wide coherence and synchrony.

Pseudomarkets with priorities in large random assignment economies

I study large random assignment economies with a continuum of agents and a finite number of object types. I consider the existence of weak priorities discriminating among agents with respect to their rights concerning the final assignment. The respect for priorities ex ante (ex-ante stability) usually precludes ex-ante envy-freeness. Therefore I define a new concept of fairness, called no unjustified lower chances: priorities with respect to one object type cannot justify different achievable chances regarding another object type. This concept, which applies to the assignment mechanism rather than to the assignment itself, implies ex-ante envy-freeness among agents of the same priority type. I propose a variation of Hylland and Zeckhauser' (1979) pseudomarket that meets ex-ante stability, no unjustified lower chances and ex-ante efficiency among agents of the same priority type. Assuming enough richness in preferences and priorities, the converse is also true: any random assignment with these properties could be achieved through an equilibrium in a pseudomarket with priorities. If priorities are acyclical (the ordering of agents is the same for each object type), this pseudomarket achieves ex-ante efficient random assignments.

Growth in a Cross-Section of Cities: Location, Increasing Returns or Random Growth?

This article analyzes empirically the main existing theories on income and population city growth: increasing returns to scale, locational fundamentals and random growth. To do this we implement a threshold nonlinearity test that extends standard linear growth regression models to a dataset on urban, climatological and macroeconomic variables on 1,175 U.S. cities. Our analysis reveals the existence of increasing returns when per-capita income levels are beyond $19; 264. Despite this, income growth is mostly explained by social and locational fundamentals. Population growth also exhibits two distinct equilibria determined by a threshold value of 116,300 inhabitants beyond which city population grows at a higher rate. Income and population growth do not go hand in hand, implying an optimal level of population beyond which income growth stagnates or deteriorates