SearcharxivSearch

arXiv · 1801.07600

Conditioned point processes with application to Lévy bridges

Abstract

Our first result concerns a characterisation by means of a functional equation of Poisson point processes conditioned by the value of their first moment. It leads to a generalised version of Mecke's formula. En passant, it also allows to gain quantitative results about stochastic domination for Poisson point processes under linear constraints. Since bridges of a pure jump Lévy process in $\mathbb{R}^d$ with a height $a$ can be interpreted as a Poisson point process on space-time conditioned by pinning its first moment to $a$, our approach allows us to characterize bridges of Lévy processes by means of a functional equation. The latter result has two direct applications: first we obtain a constructive and simple way to sample Lévy bridge dynamics; second it allows to estimate the number of jumps for such bridges. We finally show that our method remains valid for linearly perturbed Lévy processes like periodic Ornstein-Uhlenbeck processes driven by Lévy noise.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Giovanni Conforti, Tetiana Kosenkova, Sylvie Roelly. 2018-01-23. Conditioned point processes with application to Lévy bridges. https://doi.org/10.1007/s10959-018-0863-8

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