The aim of this paper is to present some ideas how to relax the notion of the optimal solution of the stochastic optimization problem. In the deterministic case, $\epsilon$-minimal solutions and level-minimal solutions are considered as desired relaxations. We call them approximative solutions and we introduce some possibilities how to combine them with randomness. Relations among random versions of approximative solutions and their consistency are presented in this paper. No measurability is assumed, therefore,...

We consider a differential equation with a random rapidly varying coefficient. The random coefficient is a gaussian process with slowly decaying correlations and compete with a periodic component. In the asymptotic framework corresponding to the separation of scales present in the problem, we prove that the solution of the differential equation converges in distribution to the solution of a stochastic differential equation driven by a classical brownian motion in some cases, by a fractional brownian...

We consider a differential equation with a random rapidly varying coefficient. The random coefficient is a Gaussian process with slowly decaying correlations and compete with a periodic component. In the asymptotic framework corresponding to the separation of scales present in the problem, we prove that the solution of the differential equation converges in distribution to the solution of a stochastic differential equation driven by a classical Brownian motion in some cases, by a fractional Brownian motion...

Let $(X_t,t\ge 0)$ be a Lévy process started at $0$, with Lévy measure $\nu$. We consider the first passage time $T_x$ of $(X_t,t\ge 0)$ to level $x\>0$, and $K_x:=X_{T_x}-𝑥$ the overshoot and $L_x:=x-X_{T_{{𝑥}^{-}}}$ the undershoot. We first prove that the Laplace transform of the random triple $(T_x,K_x,L_x)$ satisfies some kind of integral equation. Second, assuming that $\nu$ admits exponential moments, we show that $(\widetilde{T_x},K_x,L_x)$ converges in distribution as $x\to \infty$, where $\widetilde{T_x}$ denotes a suitable renormalization of $T_x$.

Let (Xt, t ≥ 0) be a Lévy process started at 0, with Lévy measure ν. We consider the first passage time Tx of (Xt, t ≥ 0) to level x > 0, and Kx := XTx - x the overshoot and Lx := x- XTx- the undershoot. We first prove that the Laplace transform of the random triple (Tx,Kx,Lx) satisfies some kind of integral equation. Second, assuming that ν admits exponential moments, we show that $(\widetilde{T_x},K_x,L_x)$ converges in distribution as x → ∞, where $\widetilde{T_x}$ denotes a suitable renormalization of Tx.


We prove, by means of Malliavin calculus, the convergence in $L^2$ of some properly renormalized weighted quadratic variations of bi-fractional Brownian motion (biFBM) with parameters $H$ and $K$, when $H\<1/4$ and $K\in (0,1]$.

We study the asymptotic behaviour, as n → ∞, of the Lebesgue measure of the set $x\in K:|P_E\left(x\right)|\le t$ for a random k-dimensional subspace E ⊂ ℝⁿ and an isotropic convex body K ⊂ ℝⁿ. For k growing slowly to infinity, we prove it to be close to the suitably normalised Gaussian measure in ${ℝ}^k$ of a t-dilate of the Euclidean unit ball. Some of the results hold for a wider class of probabilities on ℝⁿ.

We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large n, a networked data structure consisting of n units connected by an average number of links of order n / log n can be coded by about H × n bits, where H is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical...

We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large n, a networked data structure consisting of n units connected by an average number of links of order n / log n can be coded by about H × n bits, where H is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical...