SearcharxivSearch

arXiv · 2105.13015

A recursive representation for decoupling time-state dependent jumps from jump-diffusion processes

Abstract

We establish a recursive representation that fully decouples jumps from a large class of multivariate inhomogeneous stochastic differential equations with jumps of general time-state dependent unbounded intensity, not of L\'evy-driven type that essentially benefits a lot from independent and stationary increments. The recursive representation, along with a few related ones, are derived by making use of a jump time of the underlying dynamics as an information relay point in passing the past on to a previous iteration step to fill in the missing information on the unobserved trajectory ahead. We prove that the proposed recursive representations are convergent exponentially fast in the limit, and can be represented in a similar form to Picard iterates under the probability measure with its jump component suppressed. On the basis of each iterate, we construct upper and lower bounding functions that are also convergent towards the true solution as the iterations proceed. We provide numerical results to justify our theoretical findings.

Explore related subjects

Keep this discovery

BibTeXRIS

Qinjing Qiu, Reiichiro Kawai. 2021-05-27. A recursive representation for decoupling time-state dependent jumps from jump-diffusion processes. https://doi.org/10.1080/17442508.2023.2259534

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