Les processus additifs markoviens et leurs applications en finance mathématique

Cette thèse porte sur les questions d'évaluation et de couverture des options dans un modèle exponentiel-Lévy avec changements de régime. Un tel modèle est construit sur un processus additif markovien un peu comme le modèle de Black- Scholes est basé sur un mouvement Brownien. Du fait de l'existence de plusieurs sources d'aléa, nous sommes en présence d'un marché incomplet et ce fait rend inopérant les développements théoriques initiés par Black et Scholes et Merton dans le cadre d'un marché complet. Nous montrons dans cette thèse que l'utilisation de certains résultats de la théorie des processus additifs markoviens permet d'apporter des solutions aux problèmes d'évaluation et de couverture des options. Notamment, nous arrivons à caracté- riser la mesure martingale qui minimise l'entropie relative à la mesure de probabilit é historique ; aussi nous dérivons explicitement sous certaines conditions, le portefeuille optimal qui permet à un agent de minimiser localement le risque quadratique associé. Par ailleurs, dans une perspective plus pratique nous caract érisons le prix d'une option Européenne comme l'unique solution de viscosité d'un système d'équations intégro-di érentielles non-linéaires. Il s'agit là d'un premier pas pour la construction des schémas numériques pour approcher ledit prix.

T-Policy in Reliability and Inventory

In this thesis T-policy is implemented to the inventory system with random lead time and also repair in the reliability of k-out-of-n system. Inventory system may be considered as the system of keeping records of the amounts of commodities in stock. Reliability is defined as the ability of an entity to perform a required function under given conditions for a given time interval. It is measured by the probability that an entity E can perform a required function under given conditions for the time interval. In this thesis considered k-out-of-n system with repair and two modes of service under T-policy. In this case first server is available always and second server is activated on elapse of T time units. The lead time is exponentially distributed with parameter  and T is exponentially distributed with parameter  from the epoch at which it was inactivated after completion of repair of all failed units in the previous cycle, or the moment n-k failed units accumulate. The repaired units are assumed to be as good as new. In this study , three different situations, ie; cold system, warm system and hot system. A k-out-of-n system is called cold, warm or hot according as the functional units do not fail, fail at a lower rate or fail at the same rate when system is shown as that when it is up.

Efficient solutions to factored MDPs with imprecise transition probabilities

When modeling real-world decision-theoretic planning problems in the Markov Decision Process (MDP) framework, it is often impossible to obtain a completely accurate estimate of transition probabilities. For example, natural uncertainty arises in the transition specification due to elicitation of MOP transition models from an expert or estimation from data, or non-stationary transition distributions arising from insufficient state knowledge. In the interest of obtaining the most robust policy under transition uncertainty, the Markov Decision Process with Imprecise Transition Probabilities (MDP-IPs) has been introduced to model such scenarios. Unfortunately, while various solution algorithms exist for MDP-IPs, they often require external calls to optimization routines and thus can be extremely time-consuming in practice. To address this deficiency, we introduce the factored MDP-IP and propose efficient dynamic programming methods to exploit its structure. Noting that the key computational bottleneck in the solution of factored MDP-IPs is the need to repeatedly solve nonlinear constrained optimization problems, we show how to target approximation techniques to drastically reduce the computational overhead of the nonlinear solver while producing bounded, approximately optimal solutions. Our results show up to two orders of magnitude speedup in comparison to traditional ""flat"" dynamic programming approaches and up to an order of magnitude speedup over the extension of factored MDP approximate value iteration techniques to MDP-IPs while producing the lowest error of any approximation algorithm evaluated. (C) 2011 Elsevier B.V. All rights reserved.

Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético

Techniques of optimization known as metaheuristics have achieved success in the resolution of many problems classified as NP-Hard. These methods use non deterministic approaches that reach very good solutions which, however, don t guarantee the determination of the global optimum. Beyond the inherent difficulties related to the complexity that characterizes the optimization problems, the metaheuristics still face the dilemma of xploration/exploitation, which consists of choosing between a greedy search and a wider exploration of the solution space. A way to guide such algorithms during the searching of better solutions is supplying them with more knowledge of the problem through the use of a intelligent agent, able to recognize promising regions and also identify when they should diversify the direction of the search. This way, this work proposes the use of Reinforcement Learning technique - Q-learning Algorithm - as exploration/exploitation strategy for the metaheuristics GRASP (Greedy Randomized Adaptive Search Procedure) and Genetic Algorithm. The GRASP metaheuristic uses Q-learning instead of the traditional greedy-random algorithm in the construction phase. This replacement has the purpose of improving the quality of the initial solutions that are used in the local search phase of the GRASP, and also provides for the metaheuristic an adaptive memory mechanism that allows the reuse of good previous decisions and also avoids the repetition of bad decisions. In the Genetic Algorithm, the Q-learning algorithm was used to generate an initial population of high fitness, and after a determined number of generations, where the rate of diversity of the population is less than a certain limit L, it also was applied to supply one of the parents to be used in the genetic crossover operator. Another significant change in the hybrid genetic algorithm is the proposal of a mutually interactive cooperation process between the genetic operators and the Q-learning algorithm. In this interactive/cooperative process, the Q-learning algorithm receives an additional update in the matrix of Q-values based on the current best solution of the Genetic Algorithm. The computational experiments presented in this thesis compares the results obtained with the implementation of traditional versions of GRASP metaheuristic and Genetic Algorithm, with those obtained using the proposed hybrid methods. Both algorithms had been applied successfully to the symmetrical Traveling Salesman Problem, which was modeled as a Markov decision process

Comments about some species abundance patterns: classic, neutral, and niche partitioning models

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Processo markoviano de decisão para alocação dinâmica de recursos e controle de admissão de conexão em redes IEEE 802.16

Este trabalho apresenta uma solução para o problema de controle admissão de conexão e alocação dinâmica de recursos em redes IEEE 802.16 através da modelagem de um Processo Markoviano de Decisão (PMD) utilizando o conceito de degradação de largura de banda, o qual é baseado nos requisitos diferenciados de largura de banda das classes de serviço do IEEE 802.16. Para o critério de desempenho do PMD é feita a atribuição de diferentes retornos a cada classe de serviço, fazendo assim o tratamento diferenciado de cada fluxo. Nesse sentido, é possível avaliar a política ótima, obtida através de um algoritmo de iteração de valores, considerando aspectos como o nível de degradação médio das classes de serviço, utilização dos recursos e probabilidades de bloqueios de cada classe de serviço em relação à carga do sistema. Resultados obtidos mostram que o método de controle markoviano proposto é capaz de priorizar as classes de serviço consideradas mais relevantes para o sistema.

QoS management in smart grids: a Markovian approach

In Smart Grids, a variety of new applications are available to users of the electrical system (from consumers to the electric system operators and market operators). Some applications such as the SCADA systems, which control generators or substations, have consequences, for example, with a communication delay. The result of a failure to deliver a control message due to noncompliance of the time constraint can be catastrophic. On the other hand, applications such as smart metering of consumption have fewer restrictions. Since each type of application has different quality of service requirements (importance, delay, and amount of data to transmit) to transmit its messages, the policy to control and share the resources of the data communication network must consider them. In this paper Markov Decision Process Theory is employed to determine optimal policies to explore as much as possible the availability of throughput in order to transmit all kinds of messages, considering the quality of service requirements defined to each kind of message. First a non-preemptive model is formulated and after that a preemptive model is derived. Numerical results are used to compare FIFO, non-preemptive and preemptive policies.

Bisphenol-A promotes antiproliferative effects during neonatal prostate development in male and female gerbils

Conselho Nacional de Desenvolvimento Científico e Tecnol[ogico (CNPq)

Parameterschätzung in Verzweigungsprozessen mit Immigration

Im Verzweigungsprozess mit Immigration werden Schätzer für die erwartete Nachkommenzahl m eines Individuums und die erwartete Immigration λ pro Generation konstruiert. Sie sind nur aufgrund der beobachteten Populationsgröße einer jeden Generation konsistent, ohne Vorkenntnis darüber, ob der Prozess subkritisch (m<1), kritisch (m=1) oder superkritisch (m>1) ist. Im superkritischen Fall ist der Schätzer für λ jedoch nicht konsistent. Dies ist aber keine Einschränkung, denn es wird gezeigt, dass in diesem Fall kein konsistenter Schätzer für λ existiert. Des Weiteren werden Konvergenzgeschwindigkeit der Schätzer und asymptotische Verteilungen der Schätzfehler untersucht. Dabei werden die Fälle (m<1), (m>1) und (m=1) unterschieden, was gänzlich verschiedene Vorgehensweisen erfordert (Ergodizität, Martingalmethoden, Diffusionsapproximationen). Diese hier vorliegende Diplomarbeit orientiert sich an den Ideen und Ergebnissen von Wei und Winnicki (1989/90).

Predicting the Fed

Predicting the federal funds rate and beating the federal funds futures market: mission impossible? Not so. We employ a Markov transition process and show that this model outperforms the federal funds futures market in predicting the target federal funds rate. Thus, by using purely historical data we are able to better explain future monetary policy than a forward looking measure like the federal funds futures rate. The fact that the federal funds futures market can be beaten by a statistical model, suggests that the federal funds futures market lacks eciency. The mar- ket allocates too much weight to current Federal Reserve communication and other real-time macro events, and allocates too little weight to past monetary policy behavior.

A unified framework for linear function approximation of value functions in stochastic control

This paper contributes with a unified formulation that merges previ- ous analysis on the prediction of the performance ( value function ) of certain sequence of actions ( policy ) when an agent operates a Markov decision process with large state-space. When the states are represented by features and the value function is linearly approxi- mated, our analysis reveals a new relationship between two common cost functions used to obtain the optimal approximation. In addition, this analysis allows us to propose an efficient adaptive algorithm that provides an unbiased linear estimate. The performance of the pro- posed algorithm is illustrated by simulation, showing competitive results when compared with the state-of-the-art solutions.

Social transmission of reproductive behavior increases frequency of inherited disorders in a young-expanding population

The observation of high frequencies of certain inherited disorders in the population of Saguenay–Lac Saint Jean can be explained in terms of the variance and the correlation of effective family size (EFS) from one generation to the next. We have shown this effect by using the branching process approach with real demographic data. When variance of EFS is included in the model, despite its profound effect on mutant allele frequency, any mutant introduced in the population never reaches the known carrier frequencies (between 0.035 and 0.05). It is only when the EFS correlation between generations is introduced into the model that we can explain the rise of the mutant alleles. This correlation is described by a c parameter that reflects the dependency of children’s EFS on their parents’ EFS. The c parameter can be considered to reflect social transmission of demographic behavior. We show that such social transmission dramatically reduces the effective population size. This could explain particular distributions in allele frequencies and unusually high frequency of certain inherited disorders in some human populations.

A simple explanation for taxon abundance patterns

For taxonomic levels higher than species, the abundance distributions of the number of subtaxa per taxon tend to approximate power laws but often show strong deviations from such laws. Previously, these deviations were attributed to finite-time effects in a continuous-time branching process at the generic level. Instead, we describe herein a simple discrete branching process that generates the observed distributions and find that the distribution's deviation from power law form is not caused by disequilibration, but rather that it is time independent and determined by the evolutionary properties of the taxa of interest. Our model predicts—with no free parameters—the rank-frequency distribution of the number of families in fossil marine animal orders obtained from the fossil record. We find that near power law distributions are statistically almost inevitable for taxa higher than species. The branching model also sheds light on species-abundance patterns, as well as on links between evolutionary processes, self-organized criticality, and fractals.

A power law for cells

Darwin observed that multiple, lowly organized, rudimentary, or exaggerated structures show increased relative variability. However, the cellular basis for these laws has never been investigated. Some animals, such as the nematode Caenorhabditis elegans, are famous for having organs that possess the same number of cells in all individuals, a property known as eutely. But for most multicellular creatures, the extent of cell number variability is unknown. Here we estimate variability in organ cell number for a variety of animals, plants, slime moulds, and volvocine algae. We find that the mean and variance in cell number obey a power law with an exponent of 2, comparable to Taylor's law in ecological processes. Relative cell number variability, as measured by the coefficient of variation, differs widely across taxa and tissues, but is generally independent of mean cell number among homologous tissues of closely related species. We show that the power law for cell number variability can be explained by stochastic branching process models based on the properties of cell lineages. We also identify taxa in which the precision of developmental control appears to have evolved. We propose that the scale independence of relative cell number variability is maintained by natural selection.

Population dynamics of flaviviruses revealed by molecular phylogenies.

The phylogeny of 123 complete envelope gene sequences was reconstructed in order to understand the evolution of tick- and mosquito-borne flaviviruses. An analysis of phylogenetic tree structure reveals a continual and asymmetric branching process in the tick-borne flaviviruses, compared with an explosive radiation in the last 200 years in viruses transmitted by mosquitoes. The distinction between these two viral groups probably reflects differences in modes of dispersal, propagation, and changes in the size of host populations. The most serious implication of this work is that growing human populations are being exposed to an expanding range of increasingly diverse viral strains.