SearcharxivSearch

arXiv · 2510.18106

Law equivalence for Ornstein--Uhlenbeck dynamics driven by L\'evy noise

Abstract

For stochastic partial differential equations driven by L\'evy noise, understanding when changes in the drift operator preserve the law of the solution is fundamental to filtering, control, and simulation. We extend law-comparison results for Ornstein--Uhlenbeck processes from bounded drift operators to generators of $C_0$-semigroups on a separable Hilbert space. The argument separates the problem into a Gaussian channel and a jump--drift channel. The Gaussian channel is governed by an inverse-covariance Hilbert--Schmidt perturbation condition. The jump--drift channel is handled by a directional Cameron--Martin condition, formulated conditionally on the jump path; no unconditional Novikov estimate is needed for this step. We prove that these hypotheses give absolute continuity of path laws on the Skorohod space, and equivalence whenever the Gaussian channels are equivalent. For purely jump noise we prove a rigidity phenomenon: absolute continuity forces the two solutions to coincide. For analytic semigroups and compound Poisson jumps we give verifiable sufficient conditions in terms of fractional smoothing and the boundedness of $Q^{-1/2}(\widetilde A-A)A^{-\beta}$. Diagonal examples show the sharp role of the Cameron--Martin and inverse-covariance requirements.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tomasz Kania. 2025-10-20. Law equivalence for Ornstein--Uhlenbeck dynamics driven by L\'evy noise. https://arxiv.org/abs/2510.18106

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