Displaying 1001 – 1020 of 2837

Showing per page

(Homogeneous) markovian bridges

Vincent Vigon (2011)

Annales de l'I.H.P. Probabilités et statistiques

(Homogeneous) Markov bridges are (time homogeneous) Markov chains which begin at a given point and end at a given point. The price to pay for preserving the homogeneity is to work with processes with a random life-span. Bridges are studied both for themselves and for their use in describing the transformations of Markov chains: restriction on a random interval, time reversal, time change, various conditionings comprising the confinement in some part of the state space. These bridges lead us to look...

Homogenization of a semilinear parabolic PDE with locally periodic coefficients: a probabilistic approach

Abdellatif Benchérif-Madani, Étienne Pardoux (2007)

ESAIM: Probability and Statistics

In this paper, a singular semi-linear parabolic PDE with locally periodic coefficients is homogenized. We substantially weaken previous assumptions on the coefficients. In particular, we prove new ergodic theorems. We show that in such a weak setting on the coefficients, the proper statement of the homogenization property concerns viscosity solutions, though we need a bounded Lipschitz terminal condition.

Homogenization of locally stationary diffusions with possibly degenerate diffusion matrix

Rémi Rhodes (2009)

Annales de l'I.H.P. Probabilités et statistiques

This paper deals with homogenization of second order divergence form parabolic operators with locally stationary coefficients. Roughly speaking, locally stationary coefficients have two evolution scales: both an almost constant microscopic one and a smoothly varying macroscopic one. The homogenization procedure aims to give a macroscopic approximation that takes into account the microscopic heterogeneities. This paper follows [Probab. Theory Related Fields (2009)] and improves this latter work by...

Identification of optimal policies in Markov decision processes

Karel Sladký (2010)

Kybernetika

In this note we focus attention on identifying optimal policies and on elimination suboptimal policies minimizing optimality criteria in discrete-time Markov decision processes with finite state space and compact action set. We present unified approach to value iteration algorithms that enables to generate lower and upper bounds on optimal values, as well as on the current policy. Using the modified value iterations it is possible to eliminate suboptimal actions and to identify an optimal policy...

Currently displaying 1001 – 1020 of 2837