SearcharxivSearch

arXiv · 0910.4959

A new kind of augmentation of filtrations

Abstract

Let $(\Omega,\mathcal{F},(\mathcal{F}_t)_{t \geq 0},\mathbb{P})$ be a filtered probability space satisfying the usual assumptions: it is usually not possible to extend to $\mathcal{F}_{\infty}$ (the $\sigma$-algebra generated by $(\mathcal{F}_t)_{t \geq 0}$) a coherent family of probability measures $(\mathbb{Q}_t)$, each of them being defined on $\mathcal{F}_t$. It is known that for instance, on the Wiener space, this extension problem has a positive answer if one takes the filtration generated by the coordinate process, but can have a negative answer if one takes its usual augmentation. On the other hand, the usual assumptions are crucial in order to obtain the existence of regular versions of paths for most stochastic processes of interest, such as the local time of the standard Brownian motion, stochastic integrals, etc. In order to fix this problem, we introduce a new property for filtrations, intermediate between the right continuity and the usual conditions. We show that most of the important results of the theory of stochastic processes which are generally proved under the usual augmentation, such as the existence of regular version of trajectories or the d\'ebut theorem, still hold under the N-augmentation; moreover this new augmentation allows the extension of a coherent family of probability measures whenever this is possible with the original filtration.

Explore related subjects

Keep this discovery

BibTeXRIS

Joseph Najnudel, Ashkan Nikeghbali. 2009-10-26. A new kind of augmentation of filtrations. https://arxiv.org/abs/0910.4959

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR