ترغب بنشر مسار تعليمي؟ اضغط هنا

Exit times for semimartingales under nonlinear expectation

72   0   0.0 ( 0 )
 نشر من قبل Guomin Liu
 تاريخ النشر 2018
  مجال البحث
والبحث باللغة English
 تأليف Guomin Liu




اسأل ChatGPT حول البحث

Let $mathbb{hat{E}}$ be the upper expectation of a weakly compact but non-dominated family $mathcal{P}$ of probability measures. Assume that $Y$ is a $d$-dimensional $mathcal{P}$-semimartingale under $mathbb{hat{E}}$. Given an open set $Qsubsetmathbb{R}^{d}$, the exit time of $Y$ from $Q$ is defined by [ {tau}_{Q}:=inf{tgeq0:Y_{t}in Q^{c}}. ] The main objective of this paper is to study the quasi-continuity properties of ${tau}_{Q}$ under the nonlinear expectation $mathbb{hat{E}}$. Under some additional assumptions on the growth and regularity of $Y$, we prove that ${tau}_{Q}wedge t$ is quasi-continuous if $Q$ satisfies the exterior ball condition. We also give the characterization of quasi-continuous processes and related properties on stopped processes. In particular, we get the quasi-continuity of exit times for multi-dimensional $G$-martingales, which nontrivially generalizes the previous one-dimensional result of Song.



قيم البحث

اقرأ أيضاً

68 - Hanwu Li 2019
In this paper, we study the optimal multiple stopping problem under the filtration consistent nonlinear expectations. The reward is given by a set of random variables satisfying some appropriate assumptions rather than an RCLL process. We first const ruct the optimal stopping time for the single stopping problem, which is no longer given by the first hitting time of processes. We then prove by induction that the value function of the multiple stopping problem can be interpreted as the one for the single stopping problem associated with a new reward family, which allows us to construct the optimal multiple stopping times. If the reward family satisfies some strong regularity conditions, we show that the reward family and the value functions can be aggregated by some progressive processes. Hence, the optimal stopping times can be represented as hitting times.
In this paper we develop the theory of the so-called $mathbf{W}$ and $mathbf{Z}$ scale matrices for (upwards skip-free) discrete-time and discrete-space Markov additive processes, along the lines of the analogous theory for Markov additive processes in continuous-time. In particular, we provide their probabilistic construction, identify the form of the generating function of $mathbf{W}$ and its connection with the occupation mass formula, which provides the tools for deriving semi-explicit expressions for corresponding exit problems for the upward-skip free process and its reflections, in terms the scale matrices.
We consider random walk on dynamical percolation on the discrete torus $mathbb{Z}_n^d$. In previous work, mixing times of this process for $p<p_c(mathbb{Z}^d)$ were obtained in the annealed setting where one averages over the dynamical percolation en vironment. Here we study exit times in the quenched setting, where we condition on a typical dynamical percolation environment. We obtain an upper bound for all $p$ which for $p<p_c$ matches the known lower bound.
64 - Hanwu Li 2018
We develop a theory of optimal stopping problems under G-expectation framework. We first define a new kind of random times, called G-stopping times, which is suitable for this problem. For the discrete time case with finite horizon, the value functio n is defined backwardly and we show that it is the smallest G-supermartingale dominating the payoff process and the optimal stopping time exists. Then we extend this result both to the infinite horizon and to the continuous time case. We also establish the relation between the value function and solution of reflected BSDE driven by G-Brownian motion.
The simulation of exit times for diffusion processes is a challenging task since it concerns many applications in different fields like mathematical finance, neuroscience, reliability... The usual procedure is to use discretiza-tion schemes which unf ortunately introduce some error in the target distribution. Our aim is to present a new algorithm which simulates exactly the exit time for one-dimensional diffusions. This acceptance-rejection algorithm requires to simulate exactly the exit time of the Brownian motion on one side and the Brownian position at a given time, constrained not to have exit before, on the other side. Crucial tools in this study are the Girsanov transformation, the convergent series method for the simulation of random variables and the classical rejection sampling. The efficiency of the method is described through theoretical results and numerical examples.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا