Optimal designs for the prediction in hierarchical random coefficient regression models

Magdeburg, Univ., Fak. für Mathematik, Diss., 2015

The complexity of random ordered structures

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

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.

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 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.

Gene amplification in Rhynchosciara (1955-1987)

A review is made of the evidence indicating the existence of gene amplification in Rhynchosciara, from the early cytological work to the more recent studies using cloned sequences from the DNA puffs. Mention is made of work still in progress which indicates that the transcription unit of a DNA puff is surprisingly complex.

Evidence for transcript networks composed of chimeric RNAs in human cells.

The classic organization of a gene structure has followed the Jacob and Monod bacterial gene model proposed more than 50 years ago. Since then, empirical determinations of the complexity of the transcriptomes found in yeast to human has blurred the definition and physical boundaries of genes. Using multiple analysis approaches we have characterized individual gene boundaries mapping on human chromosomes 21 and 22. Analyses of the locations of the 5' and 3' transcriptional termini of 492 protein coding genes revealed that for 85% of these genes the boundaries extend beyond the current annotated termini, most often connecting with exons of transcripts from other well annotated genes. The biological and evolutionary importance of these chimeric transcripts is underscored by (1) the non-random interconnections of genes involved, (2) the greater phylogenetic depth of the genes involved in many chimeric interactions, (3) the coordination of the expression of connected genes and (4) the close in vivo and three dimensional proximity of the genomic regions being transcribed and contributing to parts of the chimeric RNAs. The non-random nature of the connection of the genes involved suggest that chimeric transcripts should not be studied in isolation, but together, as an RNA network.

Amplification of the housekeeping sigma factor in Pseudomonas fluorescens CHA0 enhances antibiotic production and improves biocontrol abilities.

Pseudomonas fluorescens CHA0 produces a variety of secondary metabolites, in particular the antibiotics pyoluteorin and 2,4-diacetylphloroglucinol, and protects various plants from diseases caused by soilborne pathogenic fungi. The rpoD gene encoding the housekeeping sigma factor sigma 70 of P. fluorescens was sequenced. The deduced RpoD protein showed 83% identity with RpoD of Pseudomonas aeruginosa and 67% identity with RpoD of Escherichia coli. Attempts to inactivate the single chromosomal rpoD gene of strain CHA0 were unsuccessful, indicating an essential role of this gene. When rpoD was carried by an IncP vector in strain CHA0, the production of both antibiotics was increased severalfold and, in parallel, protection of cucumber against disease caused by Pythium ultimum was improved, in comparison with strain CHA0.

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.

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.