English
Related papers

Related papers: Sticky processes, local and true martingales

200 papers

We show that the existence of a martingale approximation of a stationary process depends on the choice of the filtration. There exists a stationary linear process which has a martingale approximation with respect to the natural filtration,…

Probability · Mathematics 2011-09-13 Hervé Queffélec , Dalibor Volný

In this study, we consider a class of backward SDE driven by jump Markov process. An existence and uniqueness result to this kind of equations is obtained in a locally Lipschitz case. We essentially approximate the initial problem by…

Probability · Mathematics 2018-12-27 K. Abdelhadi , N. Khelfallah

We prove a stochastic Gronwall lemma of the following type: if $Z$ is an adapted nonnegative continuous process which satisfies a linear integral inequality with an added continuous local martingale $M$ and a process $H$ on the right hand…

Probability · Mathematics 2013-04-22 Michael Scheutzow

In this paper, we develop necessary and sufficient conditions for the validity of a martingale approximation for the partial sums of a stationary process in terms of the maximum of consecutive errors. Such an approximation is useful for…

Probability · Mathematics 2011-02-11 Mikhail Gordin , Magda Peligrad

We propose a method to bound the expectation of the supremum of the price process in stochastic volatility models. It can be applied, for example, to the rough Bergomi model, avoiding the need to discuss finiteness of higher moments. Our…

Probability · Mathematics 2026-03-20 Stefan Gerhold , Julian Pachschwöll , Johannes Ruf

We consider a discrete-time process adapted to some filtration which lives on a (typically countable) subset of $\mathbb{R}^d$, $d\geq 2$. For this process, we assume that it has uniformly bounded jumps, is uniformly elliptic (can advance…

Probability · Mathematics 2014-04-28 Mikhail Menshikov , Serguei Popov

Given a finite honest time, we first show that the associated Az\'ema optional supermartingale can be expressed as the drawdown and the relative drawdown of some local optional supermartingales with continuous running supremum. The relative…

Probability · Mathematics 2021-12-22 Libo Li

Monotone processes, just like martingales, can often be recovered from their final values. Examples include running maxima of supermartingales, as well as running maxima, local times, and various integral functionals of sticky processes…

Probability · Mathematics 2018-02-26 Martin Larsson

This papers addresses the stock option pricing problem in a continuous time market model where there are two stochastic tradable assets, and one of them is selected as a num\'eraire. It is shown that the presence of arbitrarily small…

Pricing of Securities · Quantitative Finance 2014-10-01 Nikolai Dokuchaev

In this paper we estimate the rest of the approximation of a stationary process by a martingale in terms of the projections of partial sums. Then, based on this estimate, we obtain almost sure approximation of partial sums by a martingale…

Probability · Mathematics 2011-05-05 Florence Merlevède , Costel Peligrad , Magda Peligrad

Given a random sample from a random variable $T$ which is bounded from above, $T\le\tau$ a.s., we define processes that are positive supermartingales if $E(T)\ge\mu$. Such processes are called test martingales. Tests of the supermartingale…

Methodology · Statistics 2018-02-20 Harrie Hendriks

We prove that, for locally bounded processes, absence of arbitrage opportunities of the first kind is equivalent to the existence of a dominating local martingale measure. This is related to and motivated by results from the theory of…

Probability · Mathematics 2013-04-02 Peter Imkeller , Nicolas Perkowski

We consider the problem of finding a real valued martingale fitting specified marginal distributions. For this to be possible, the marginals must be increasing in the convex order and have constant mean. We show that, under the extra…

Probability · Mathematics 2008-08-19 George Lowther

It is shown that under standard hypotheses, if stochastic approximation iterates remain tight, they converge with probability one to what their o.d.e. limit suggests. A simple test for tightness (and therefore a.s. convergence) is provided.…

Probability · Mathematics 2010-07-28 Sameer Kamal

Given the univariate marginals of a real-valued, continuous-time martingale, (respectively, a family of measures parameterised by $t \in [0,T]$ which is increasing in convex order, or a double continuum of call prices) we construct a family…

Probability · Mathematics 2015-05-15 David Hobson

We establish a local martingale $M$ associate with $f(X,Y)$ under some restrictions on $f$, where $Y$ is a process of bounded variation (on compact intervals) and either $X$ is a jump diffusion (a special case being a L\'evy process) or $X$…

Probability · Mathematics 2017-11-22 Offer Kella , Marc Yor

In a fully general setting, we study the relation between martingale spaces under two locally absolutely continuous probabilities and prove that the martingale representation property (MRP) is always stable under locally absolutely…

Probability · Mathematics 2019-10-09 Anna Aksamit , Claudio Fontana

Given a sequence $(M^n)^{\infty}_{n=1}$ of nonnegative martingales starting at $M^n_0=1$, we find a sequence of convex combinations $(\widetilde{M}^n)^{\infty}_{n=1}$ and a limiting process $X$ such that…

Probability · Mathematics 2016-02-23 Christoph Czichowsky , Walter Schachermayer

Let $L$ be a linear space of real bounded random variables on the probability space $(\Omega,\mathcal{A},P_0)$. There is a finitely additive probability $P$ on $\mathcal{A}$, such that $P\sim P_0$ and $E_P(X)=0$ for all $X\in L$, if and…

Probability · Mathematics 2010-12-14 Patrizia Berti , Luca Pratelli , Pietro Rigo

Computing reachability probabilities is a fundamental problem in the analysis of probabilistic programs. This paper aims at a comprehensive and comparative account on various martingale-based methods for over- and under-approximating…

Programming Languages · Computer Science 2018-11-16 Toru Takisaka , Yuichiro Oyabu , Natsuki Urabe , Ichiro Hasuo