SearcharxivSearch

arXiv · 2507.07822

First-passage time for PDifMPs: an Exact simulation approach for time-varying thresholds

Abstract

Piecewise Diffusion Markov Processes (PDifMPs) are valuable for modelling systems where continuous dynamics are interrupted by sudden shifts and/or changes in drift and diffusion. The first-passage time (FPT) in such models plays a central role in understanding when a process first reaches a critical boundary. In many systems, time-dependent thresholds provide a flexible framework for reflecting evolving conditions, making them essential for realistic modelling. We propose a hybrid exact simulation scheme for computing the FPT of PDifMPs to time-dependent thresholds. Exact methods traditionally exist for pure diffusions, using Brownian motion as an auxiliary process and accepting sampled paths with a probability weight. Between jumps, the PDifMP evolves as a diffusion, allowing us to apply the exact method within each inter-jump interval. The main challenge arises when no threshold crossing is detected in an interval: We then need the value of the process at the jump time, and for that, we introduce an approach to simulate a conditionally constrained auxiliary process and derive the corresponding acceptance probability. Furthermore, we prove the convergence of the method and illustrate it using numerical examples.

Explore related subjects

Keep this discovery

BibTeXRIS

Sascha Desmettre, Devika Khurana, Amira Meddah. 2025-07-10. First-passage time for PDifMPs: an Exact simulation approach for time-varying thresholds. https://arxiv.org/abs/2507.07822

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