Occupation times of compact sets by planar brownian motion
Geometric random sums arise in various applied problems like physics, biology, economics, risk processes, stochastic finance, queuing theory, reliability models, regenerative models, etc. Their asymptotic behaviors with convergence rates become a big subject of interest. The main purpose of this paper is to study the asymptotic behaviors of normalized geometric random sums of independent and identically distributed random variables via Gnedenko's Transfer Theorem. Moreover, using the Zolotarev probability...
In the present paper, by using the inequality due to Talagrand's isoperimetric method, several versions of the bounded law of iterated logarithm for a sequence of independent Banach space valued random variables are developed and the upper limits for the non-random constant are given.
In the present paper, by using the inequality due to Talagrand’s isoperimetric method, several versions of the bounded law of iterated logarithm for a sequence of independent Banach space valued random variables are developed and the upper limits for the non-random constant are given.
We first generalize, in an abstract framework, results on the order of convergence of a semi-discretization in time by an implicit Euler scheme of a stochastic parabolic equation. In this part, all the coefficients are globally Lipchitz. The case when the nonlinearity is only locally Lipchitz is then treated. For the sake of simplicity, we restrict our attention to the Burgers equation. We are not able in this case to compute a pathwise order of the approximation, we introduce the weaker notion...
We first generalize, in an abstract framework, results on the order of convergence of a semi-discretization in time by an implicit Euler scheme of a stochastic parabolic equation. In this part, all the coefficients are globally Lipchitz. The case when the nonlinearity is only locally Lipchitz is then treated. For the sake of simplicity, we restrict our attention to the Burgers equation. We are not able in this case to compute a pathwise order of the approximation, we introduce the weaker notion...