Optimal design in the presence of random or fixed block effects

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

Approximations and asymptotic expansions for sums of heavy-tailed random variables

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

Optimal designs for the prediction in hierarchical random coefficient regression models

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

Relationships among the living genera of beaked whales with classifications, diagnoses, and keys. a selection from the collection of Mr. and Mrs. Harold G. Duckworth. [Exhibition] December 1, 1968-January 12, 1969.

v.53:no.4(1968)

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.

The keys to success: the social, sporting, economic and communications impact of Barcelona'92

This book is a collection of articles which analyze the sporting, social, political, communicative, urban, technological and economic impacts of the 1992 Barcelona Olympic Games.

Keys to interpret the Games: Sydney 2000 Olympics

Document published by the CEO-UAB, corresponding to the results of the research undertaken by the author during the celebration of the Sydney 2000 Games.

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.

Spectral analysis of random sparse matrices

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