scholarly journals Topological method for coupled systems of impulsive stochastic semilinear differential inclusions with fractional Brownian motion

2019 ◽  
Vol 20 (1) ◽  
pp. 71-106 ◽  
Author(s):  
T. Blouhi ◽  
◽  
T. Caraballo ◽  
A. Ouahab ◽  
◽  
...  
Author(s):  
Mariusz Michta ◽  
Jerzy Motyl

AbstractThe paper deals with some properties of set-valued functions having bounded Riesz p-variation. Set-valued integrals of Young type for such multifunctions are introduced. Selection results and properties of such set-valued integrals are discussed. These integrals contain as a particular case set-valued stochastic integrals with respect to a fractional Brownian motion, and therefore, their properties are crucial for the investigation of solutions to stochastic differential inclusions driven by a fractional Brownian motion.


2020 ◽  
Vol 75 (4) ◽  
Author(s):  
Mariusz Michta ◽  
Jerzy Motyl

AbstractThe paper deals with some selection properties of set-valued functions and different types of set-valued integrals of a Young type. Such integrals are considered for classes of Hölder continuous or with bounded Young p-variation set-valued functions. Two different cases are considered, namely set-valued functions with convex values and without convexity assumptions. The integrals contain as a particular case set-valued stochastic integrals with respect to a fractional Brownian motion, and therefore, their properties are crucial for the investigation of solutions to stochastic differential inclusions driven by a fractional Brownian motion.


2014 ◽  
Vol 51 (1) ◽  
pp. 1-18 ◽  
Author(s):  
Dawei Hong ◽  
Shushuang Man ◽  
Jean-Camille Birget ◽  
Desmond S. Lun

We construct a wavelet-based almost-sure uniform approximation of fractional Brownian motion (FBM) (Bt(H))_t∈[0,1] of Hurst index H ∈ (0, 1). Our results show that, by Haar wavelets which merely have one vanishing moment, an almost-sure uniform expansion of FBM for H ∈ (0, 1) can be established. The convergence rate of our approximation is derived. We also describe a parallel algorithm that generates sample paths of an FBM efficiently.


Sign in / Sign up

Export Citation Format

Share Document